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 4 of 4 for “"total dominating set"”.
-
Locating and Total Dominating Sets in Trees.
A set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct …
-
Total Domination Ratios of Archimedean Lattices
… regular tiling which is vertex transitive. A subset of vertices $D$ dominates a graph $G=(V_G,E_G)$ if all elements of $V_G$ either belong to $D$ or are adjacent to an element of $D$. A dominating set of vertices is a total dominating set if every vertex is adjacent to an element of the set. A …
-
Vertices in Total Dominating Sets.
… let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is …
-
Using Domination to Analyze RNA Structures.
Understanding RNA molecules is important to genomics research. Recently researchers at the Courant Institute of Mathematical Sciences used graph theory to model RNA molecules and provided a database of trees representing possible secondary RNA structures. In this thesis we use domination parameters …