{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-4435"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-4435","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Global Supply Sets in Graphs","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Moore, Christian G"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-05-01T07:00:00Z","date_published":"2016-05-01T07:00:00Z","updated_at":"2026-11-19T07:55:07Z","subjects":["graph theory","supply sets","global supply sets","Discrete Mathematics and Combinatorics","Mathematics"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3025","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3025","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/4435/viewcontent/MooreC042016f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-4435","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Moore, Christian G"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2016-04-01T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2016-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["graph theory","supply sets","global supply sets","Discrete Mathematics and Combinatorics","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/4435/viewcontent/MooreC042016f.pdf","https://dc.etsu.edu/etd/3025"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Global Supply Sets in Graphs"]}]}],"canonical_facts":{"dc:creator":["Moore, Christian G"],"dc:date.available":["2016-04-01T07:00:00Z"],"dc:date.issued":["2016-05-01T07:00:00Z"],"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."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/4435/viewcontent/MooreC042016f.pdf","https://dc.etsu.edu/etd/3025"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["graph theory","supply sets","global supply sets","Discrete Mathematics and Combinatorics","Mathematics"],"dc:title":["Global Supply Sets in Graphs"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:55:07Z"}