A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both G and its complement Ḡ. The minimum cardinality of a global dominating set of G is the global domination number of G. We determine bounds on the global domination number of a graph and relationships between it and other domination related parameters.
Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-16772 |
Date | 01 January 2015 |
Creators | Desormeaux, Wyatt J., Gibson, Philip E., Haynes, Teresa W. |
Publisher | Digital Commons @ East Tennessee State University |
Source Sets | East Tennessee State University |
Detected Language | English |
Type | text |
Source | ETSU Faculty Works |
Page generated in 0.1331 seconds