Degree Name
MS (Master of Science)
Program
Mathematical Sciences
Date of Award
5-2016
Committee Chair or Co-Chairs
Teresa Haynes
Committee Members
Robert Beeler, Debra Knisley
Abstract
For a graph G=(V,E), a set S⊆V is a global supply set if every vertex v∈V\S has at least one neighbor, say u, in S such that u has at least as many neighbors in S as v has in V \S. The global supply number is the minimum cardinality of a global supply set, denoted γgs (G). We introduce global supply sets and determine the global supply number for selected families of graphs. Also, we give bounds on the global supply number for general graphs, trees, and grid graphs.
Document Type
Thesis - unrestricted
Recommended Citation
Moore, Christian G., "Global Supply Sets in Graphs" (2016). Electronic Theses and Dissertations. Paper 3025. https://dc.etsu.edu/etd/3025
Copyright
Copyright by the authors.