Spelling suggestions: "subject:"locating:routing set"" "subject:"nondominating set""
1 |
Trees with Unique Minimum Locating-Dominating Sets.Lane, Stephen M 06 May 2006 (has links) (PDF)
A set S of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give a construction of trees that have unique minimum locating-dominating sets.
|
2 |
Using Domination to Analyze RNA Structures.Coake, Travis Reves 07 May 2005 (has links) (PDF)
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 to predict which trees are more likely to exist in nature as RNA structures. This approach appears to have promise in graph theory applications in genomics research.
|
Page generated in 0.0853 seconds