• M.JOICE MABEL

The aim of the paper is to the importance of graph distance theoretical concepts and the applications of distance - 2 domination in graphs to various real life situations in the areas of science and engineering. A set D is a distance - 2 dominating set if for every vertex 𝑢𝜀𝑉−𝐷, d(u, D) ≤2and is denoted by 𝛾≤2(𝐺). In this paper, we get many limits and accurate values for some standard graphs. Also this paper explores mainly on the applications of distance - 2 dominating sets in networks. Nordhaus – Gaddum type results are obtained for this parameter. Distance - 2 dominating sets are identified in Routing, Radio Stations, Communication Networks and Mobile adhoc Networks and shortest path selection process.

graph, tree, network, distance vectors

"FIND THE DISTANCE OF SHORTEST PATH ALLOCATION BY USING GRAPH THEROY NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.840-843, June-2019, Available :http://www.jetir.org/papers/JETIR1906703.pdf

"FIND THE DISTANCE OF SHORTEST PATH ALLOCATION BY USING GRAPH THEROY NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp840-843, June-2019, Available at : http://www.jetir.org/papers/JETIR1906703.pdf