For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set in G. A dominating ...