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. A dominating set D such that < D > has an isolated vertex is called an isolate dominating ...