• V. VIOLA
• T. NICHOLAS

A Radio 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, D^Dd(u, v) + ⌈(f(u)+ f(v))/2⌉ ≥ 1 + 〖diam〗^Dd(G), where D^Dd(u, v) denote the Dd-distance between u and v and 〖diam〗^Dd(G) denotes the Dd-diameter of G. The radio mean Dd-distance number of f, 〖rmn〗^Dd(f) is the maximum label assigned to any vertex of G. The radio mean Dd-distance number of G, 〖rmn〗^Dd(G) is the minimum value of f of G. In this paper we find the radio mean Dd-distance number of degree splitting graphs.

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

"RADIO MEAN Dd-DISTANCE NUMBER OF DEGREE SPLITTING GRAPHSRadio mean Dd-Distance Number of Degree Splitting Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.430-434, February-2019, Available :http://www.jetir.org/papers/JETIR1902951.pdf

"RADIO MEAN Dd-DISTANCE NUMBER OF DEGREE SPLITTING GRAPHSRadio mean Dd-Distance Number of Degree Splitting Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp430-434, February-2019, Available at : http://www.jetir.org/papers/JETIR1902951.pdf