Date Thesis Awarded
2013
Access Type
Honors Thesis -- Access Restricted On-Campus Only
Degree Name
Bachelors of Science (BS)
Department
Mathematics
Advisor
Gexin Yu
Committee Members
Rex K. Kincaid
Lisa R. Anderson
Abstract
An Open Locating Dominating set is a subset of vertices of a graph such that (i) every vertex in the graph has at least one neighbor in the Open Locating Dominating set and (ii) no two vertices in the graph have the same set of neighbors in the Open Locating Dominating set. Such a set can provide insight into the structure of the graph as well as give network control or increase network robustness. We give an Integer Linear Program which finds Open Locating Dominating sets on finite graphs. Finally, we prove that the Open Locating Dominating density of the Infinite Triangular Grid is 4/13.
Recommended Citation
Oldham, Allison, "Finding Open Locating Dominating Sets on Infinite and Finite Graphs" (2013). Undergraduate Honors Theses. William & Mary. Paper 624.
https://scholarworks.wm.edu/honorstheses/624
Creative Commons License
This work is licensed under a Creative Commons Attribution-No Derivative Works 3.0 License.
Comments
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.