• Adlin Queen. R
• John Bosco. K

A Radio Mean Gd-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to ℕ such that for two distinct vertices u and v of G, d^Gd (u,v)+⌈(f(u)+f(v))/2⌉≥1+〖diam〗^Gd (G), where d^Gd (u,v) denotes the Gd-distance between u and v and 〖diam〗^Gd (G) denotes the Gd-diameter of G. The Radio Mean Gd-distance number of f, 〖rmn〗^Gd (f) is the maximum label assigned to any vertex of G. The Radio Mean Gd-distance number of G, 〖rmn〗^Gd (G) is the minimum value f of G. In this paper we find the radio mean Gd-distance number of some basic graphs

Gd-distance, Radio Mean Gd-distance, Radio mean Gd-distance number

"Radio Mean Gd-distance Number Of Some Basic Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 5, page no.l305-l309, May-2023, Available :http://www.jetir.org/papers/JETIR2305B46.pdf

"Radio Mean Gd-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.10, Issue 5, page no. ppl305-l309, May-2023, Available at : http://www.jetir.org/papers/JETIR2305B46.pdf