• Dr.G.Ramesh
• A.Sathiya

A graph G for which two vertices of a graph are said to be radial to each other if the distance between them is equal to the radius of the graph. The radial graph of a graph G, denoted by R(G), has the vertex set as in G and then two vertices are adjacent in R(G) if and only if they are radial to each other in G. In This paper we have determined the radial graph of helm graphs. The geodetic polynomials and detour geodetic polynomials of helm graphs are derived and some important results are proved

Distance, Detour geodetic polynomial, Geodetic polynomial, Helm graph, Radial graph

"Some New Results on Helm Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.533-539, November-2018, Available :http://www.jetir.org/papers/JETIR1811677.pdf

"Some New Results on Helm Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp533-539, November-2018, Available at : http://www.jetir.org/papers/JETIR1811677.pdf