• K JOHN BOSCO
• DINESH M

A Radio Heronian Mean Dd-distance Labeling of a connected graph G is an injective map f from the vertex set V(G) to the N such that for two distinct vertices u and v of G, DDd(u,v)+⌈(f(u)+√(f(u)f(v))+f(v))/3⌉≥1+diamDd(G) where DDd(u,v) denotes the Dd-distance between u and v and diamDd(G) denotes the Dd-diameter of G. The radio heronian Dd-distance number of f, rhmnDd(f) is the maximum label assigned to any vertex of G. The radio heronian Dd-distance number of G, rhmnDd(G) is the minimum value of rhmnDd(f) taken over all radio heronian Dd-distance labeling f of G.

Dd-distance, Radio heronian mean Dd-distance number.

"ON RADIO HERONIAN DD-DISTANCE MEAN LABELING OF SOME BASIC GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 1, page no.441-445, January-2021, Available :http://www.jetir.org/papers/JETIR2101264.pdf

"ON RADIO HERONIAN DD-DISTANCE MEAN LABELING 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. pp441-445, January-2021, Available at : http://www.jetir.org/papers/JETIR2101264.pdf