Loading...
Finding Open Locating Dominating Sets on Infinite and Finite Graphs
Oldham, Allison
Oldham, Allison
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.
Description
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.
Date
2013-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Graph Theory, Integer Linear Program, Infinite Grid, Open Locating Dominating Sets
Citation
Department
Mathematics