A dominating set of a graph G = (V, E) is a subset D of vertices such that every vertex in V \ D is adjacent to at least one vertex in D, and the minimum size of such a set is called the domination number denoted by γ(G). ...