Bounds on the Global Domination Number
- Desormeaux, Wyatt J.
- Gibson, Philip E.
- Haynes, Teresa W.
Publication date
January 2015
DOI Publisher
National Inquiry Services Center (NISC)Abstract
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
Add to ORKG