1Assistant Professor, Department Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar-626001, Tamilnadu, India
2Associate Professor, Department Mathematics, The Standard Fireworks Rajaratnam College for Women, Sivakasi-6262123, Tamilnadu, India
Online published on 18 March, 2017.
Let G=(V, E) be a simple connected graph. The detour radial graph RD(G) has vertex set as in G and two vertices are adjacent in RD(G) if and only if the detour distance between the vertices are equal to the detour radius of G. In this paper, we derive some results connecting radial graph and detour radial graph. Further we prove the characterization for a graph G with Hamilton cycle to be equal to RD(G)
Detour radius, Detour radial graph
