Global Supply Sets in Graphs
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Digital Commons @ East Tennessee State University
2016
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/3025 https://dc.etsu.edu/cgi/viewcontent.cgi?article=4435&context=etd |