Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Dominating sets"”.
-
Vertices in Total Dominating Sets.
… denote a property of interest concerning sets of vertices. A vertex <em>u</em> is <em>rho-good</em> if <em>u</em> is contained in a {minimum, maximum} <em>rho-set</em> in <em>G</em> and <em>rho-bad</em> if <em>u</em> is not contained in a <em>rho-set</em>. Let <em>g</em> denote the number …
-
Colourings, dominating sets and wreaths
… $2$ we consider an extremal problem concerning dominating sets. We show that all forests with a given domination number $\gamma$ have at most ${5}^{\gamma/2}$ minimum dominating sets. Furthermore, for each $\gamma$, we construct a tree with domination number $\gamma$ which has more than …
-
Locating and Total Dominating Sets in Trees.
… <em>G</em>=(<em>V</em>,<em>E</em>) is a total dominating set of <em>G</em> if every vertex of <em>V</em> is adjacent to some vertex in <em>S</em>. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of <em>V</em> are …
-
In solving the dominating set problem : group theory approach
This thesis presents a new way to find the dominating set of a graph by introducing the concept of an orbit graph and a weighted dominating set. We showed that the Blokhuis-Lam method for the football pool problem is a special case of assuming that the solution has a non-trivial automorphism group. …
-
Upset Paths and 2-Majority Tournaments
… from majority voting scenarios have minimum dominating sets that are bounded by a constant that depends only on the notion of what is meant by a majority. Moreover, they proved that when a majority means that Candidate A beats Candidate B when Candidate A is ranked above Candidate B by at …
-
Topics In Probabilistic Combinatorics
… two values. Also, the the number of independent dominating sets of given cardinality is analyzed statistically. Chapter 3 introduces the tree domination number. It is then shown that in the random graph model G(n,p) with probability tending to one, the tree domination number is one of two values. …
-
Variations of zero forcing and power domination
… results proving $\ell$-leaky forcing sets and $\ell$-edge leaky forcing sets are equivalent are provided. Furthermore, bounds for minimum sized $k$-power dominating sets in hypergraphs are proven.</p>
-
Network Based Approaches for Clustering and Location Decisions
… communication be- tween the sensors. Connected Dominating Sets (CDS) have been studied as a method of choosing nodes to be in the backbone. The traditional approach is to assume that the transmission range of each node is given and then minimize the number of nodes in the CDS representing the …
-
Resource Allocation Schemes And Performance Evaluation Models For Wavelength Division Multiplexed Optical Networks
… converters based on the concept of the k-Dominating Set (k-DS) of a graph is presented. The k-DS approach is also extended to the case of limited conversion capability using three scalable and cost-effective switch designs: flexible node-sharing, strict node-sharing and static mapping. …