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.
<p>A set <em>S</em> of vertices in a graph <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 …
-
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 …
-
Using Domination to Analyze RNA Structures.
<p>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 …
-
Topics in Probabilistic Combinatorics
… reconstructing the entirety, or a large subset, of a point set $V$ embedded in either $\mathbb{R}$ or $\mathbb{R}^d$, where the only information available about $V$ consists of the pairwise distances between some of the pairs of points. In the first section, we focus on global rigidity of …