Degree Name
MS (Master of Science)
Program
Mathematical Sciences
Date of Award
5-2006
Committee Chair or Co-Chairs
Teresa W. Haynes
Committee Members
Debra J. Knisley, Robert B. Gardner
Abstract
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.
Document Type
Thesis - unrestricted
Recommended Citation
Lane, Stephen M., "Trees with Unique Minimum Locating-Dominating Sets." (2006). Electronic Theses and Dissertations. Paper 2196. https://dc.etsu.edu/etd/2196
Copyright
Copyright by the authors.