Bounds on the Global Domination Number
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.
Desormeaux, Wyatt J.; Gibson, Philip E.; and Haynes, Teresa W.. 2015. Bounds on the Global Domination Number. Quaestiones Mathematicae. Vol.38(4). 563-572. https://doi.org/10.2989/16073606.2014.981728 ISSN: 1607-3606