Applications of Dominating Set of Graph in Computer Networks `

The aim of the paper is to impart the importance of graph theoretical concepts and the applications of domination in graphs to various real life situations in the areas of science and engineering. In a graph G = (V, E), a set S ⊆ V(G) is said to be a dominating set of G if every vertex in V?S is adjacent to atleast one vertex in S. A set S ⊆ V(G) is said to be a connected dominating set of G if S is dominating set and also the subgraph induced by S is connected. The research has been carried out extensively in various types of dominating sets. This paper explores mainly on the applications of dominating sets in computer networks.