Middle Distance Dominating Set


R. Veerasivaji & S. Meenakshi (Associate Professor), VISTAS, Chennai – 600 117


A distance dominating set D of V in is said to be Middle Distance Dominating set (MDD) if ui D such that d(ui ,v j )  k v j  V  D where k is number of vertices in D and the cardinality of G is M (G)  k , in this article show that the MDD is more effective than some other dominating set and how to construct the MDD set for the graph G using Radius algorithm and diameter algorithm. Finely we find unique dominating set for a graph G is as in middle of graph G.