Volume : V, Issue : IX, September - 2016

Detour DDistance of a graph

N. Arianayagam, J. Vijaya Xavier Parthipan

Abstract :

 For vertices u and v in a connected graph G, the detour distance D (u,v) is the length of the longest u– v path in G. A u – v path of length D (u,v) is called a u – v detour. It is known that the detour distance is a metric on the vertex set V (G). Chart and et al introduced the concept of detour distance by considering the length of the longest path between u and v. Kathiresan et al introduced the concept of superior distance and signal distance. In some of these distances only the length of various paths were considered. By considering the degrees of dominating set vertices present in the path and in addition, subtract the length of the path. In this article we introduced the concept of domination D – distance. We study some properties of this new distance.

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

N.Arianayagam, J.Vijaya Xavier Parthipan Detour DDistance of a graph International Journal of Scientific Research,Volume : 5 | Issue : 9 |September 2016

Number of Downloads : 678

References :