Bounds on the Global Domination Number
Wyatt J. Desormeaux, Philip E. Gibson, Teresa W. Haynes · Quaestiones Mathematicae · 2015
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.