|
A set D of vertices of a graph G is called a dominating set of G if every vertex in V (G) − D is adjacent to a vertex in D. A dominating set S such that the subgraph ⟨S⟩ induced by S has at least one isolated vertex is called an isolate dominating set.
|