Back to search

East Tennessee State University

Global Supply Sets in Graphs

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
MS (Master of Science)
Level thesis:degree_level
Thesis - unrestricted
Discipline thesis:degree_discipline
Mathematical Sciences
Grantor dc:publisher
East Tennessee State University
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Moore, Christian G

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Copyright by the authors.
Language dc:language
eng

Identifiers

dc:identifier.*
Repository record dc:identifier
https://dc.etsu.edu/etd/3025

Chain of custody

source
Harvested from
East Tennessee State University
Base URL
dc.etsu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Moore, Christian G. Global Supply Sets in Graphs. Thesis - unrestricted thesis, East Tennessee State University, 2016. https://dc.etsu.edu/etd/3025