• K JOHN BOSCO
• G.Vishma george

A Radio square difference Dd-distance labeling of a connected graph G is an injective function f from the vertex set V(G) to N such that for two distinct vertices u and v of G,D^Dd (u,v)+|[f〖(u)]〗^2-[f〖(v)]〗^2 |≥1+〖diam〗^Dd (G), where D^Dd (u,v) denote the Dd-distance between uand vand also 〖diam〗^Dd (G)denotes the Dd-diameter of G.The radio square difference number of f, 〖rsdn〗^Dd (f) is the maximum label assigned to any vertex of G. The radio square difference number of G, 〖rsdn〗^Dd(G) is the maximum value of f of G. In this paper we find the radio square difference number of some basic graph.

Dd-distance, SD labeling, Radio labeling, Radio square difference Dd-distance number

"ON RADIO SQUARE DIFFERENCE Dd - DISTANCE NUMBER OF CYCLE RELATED GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 1, page no.434-437, January-2021, Available :http://www.jetir.org/papers/JETIR2101262.pdf

"ON RADIO SQUARE DIFFERENCE Dd - DISTANCE NUMBER OF CYCLE RELATED GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 1, page no. pp434-437, January-2021, Available at : http://www.jetir.org/papers/JETIR2101262.pdf