Degree Name

MS (Master of Science)


Mathematical Sciences

Date of Award


Committee Chair or Co-Chairs

Teresa Haynes

Committee Members

Robert Beeler, Debra Knisley


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


Copyright by the authors.