Let G = (V, E) be a non-trivial graph. A subset D of the vertex set V of a graph G is called a dominating set of G if every vertex in V − D is adjacent to a vertex in D. The domination number is the lowest cardinality of ...