• K JOHN BOSCO
• S PRIYA

A Radio geometric mean Dd-distance labeling of a connect graph G is an injective function f from the vertex set V(G) to the N such that for two distinct vertices u and v of G,D^Dd (u,v)+⌈√(f(u)f(v) )⌉ ≥1+〖diam〗^Dd (G),where D^Dd (u,v)=D(u,v)+deg⁡(u)+deg⁡(V),D^Dd (u,v) denotes the Dd-distance between u and v diamD^Dd (G) denotes the Dd-diameter of G. The radio geometric mean Dd-distance number of f, 〖rgmn〗^Dd (f) is the maximum label assigned to any vertex of G . The radio geometric mean Dd-distance number of, 〖rgmn〗^Dd (G)is the minimum value of G, 〖rgmn〗^Dd (G) is the minimum value of 〖rgmn〗^Dd (f) taken over all radio geometric mean Dd-distance labeling f of G. In this paper we find the radio geometric mean Dd-distance number of some basic graphs.

Dd-distance, Radio geometric mean Dd-distance, Radio geometric mean Dd-distance number

"ON RADIO GEOMETRIC MEAN Dd- DISTANCE NUMBER OF SOME BASIC GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 1, page no.430-433, January-2021, Available :http://www.jetir.org/papers/JETIR2101261.pdf

"ON RADIO GEOMETRIC MEAN Dd- DISTANCE NUMBER OF SOME BASIC 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. pp430-433, January-2021, Available at : http://www.jetir.org/papers/JETIR2101261.pdf