A set of vertices S is said to dominate the graph G if for each

v /2 S, there is a vertex u 2 S with u adjacent to v, set S is called

the dominating set in graph G. A dominating set, which induces a

connected ...