Volume 40 | Number 3 | Year 2016 | Article Id. IJMTT-V40P530 | DOI : https://doi.org/10.14445/22315373/IJMTT-V40P530

A Radio Mean D-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, dD(u, v) + ⌈(f(u)+f(v))/2⌉ ≥ 1 + diamD(G), where dD(u, v) denotes the D-distance between u and v and diamD(G) denotes the D-diameter of G. The radio mean D-distance number of f, rmnD(f) is the maximum label assigned to any vertex of G. The radio mean D-distance number of G, rmnD(G) is the minimum value of rmnD(f) taken over all radio mean D-distance labeling f of G. In this paper we find the radio mean D-distance number of cycle-related graphs

[1] F. Buckley and F. Harary, Distance in Graphs,Addition- Wesley, Redwood City, CA, 1990.

[2] G. Chartrand, D. Erwinn, F. Harary, and P. Zhang, “Radio labeling of graphs,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 33, pp. 77–85, 2001.

[3] G. Chartrand, D. Erwin, and P. Zhang, Graph labeling problem suggested by FM channel restrictions, Bull. Inst. Combin. Appl., 43, 43-57(2005).

[4] C. Fernandaz, A. Flores, M. Tomova, and C. Wyels, The Radio Number of Gear Graphs, arXiv:0809. 2623, September 15, (2008).

[5] J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 19 (2012) #Ds6.

[6] W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980), pp. 1497–1514.

[7] F.Harary, Graph Theory, Addision wesley, New Delhi (1969).

[8] R. Khennoufa and O. Togni, The Radio Antipodal and Radio Numbers of the Hypercube,accepted in 2008 publication in ArsCombinatoria.

[9] D. Liu, Radio number for trees, Discrete Math. 308 (7) (2008) 1153–1164.

[10] D. Liu, X. Zhu, Multilevel distance labelings for paths and cycles, SIAM J. Discrete Math. 19 (3) (2005) 610–621.

[11] P. Murtinez, J. OrtiZ, M. Tomova, andC. Wyles, Radio Numbers For Generalized Prism Graphs, Kodai Math. J., 22,131-139(1999).

[12] T.Nicholas and K.John Bosco, Radio D-distance number of some graphs to appear.

[13] T.Nicholas and K.John Bosco, Radio mean D-distance number of banana tree family of graphs communicated.

[14] T.Nicholas, K.John Bosco and M. Antony, Radio mean D-distance labeling of some graphs, to appear.

[15] R.Ponraj, S.Sathish Narayanan and R.Kala, Radio mean labeling of graphs, AKCE International Journal of Graphs and Combinatorics 12 (2015) 224–228.

[16] R.Ponraj, S.Sathish Narayanan and R.Kala, On Radio Mean Number of Some Graphs, International J.Math. Combin. Vol.3(2014), 41-48.

[17] R.Ponraj, S.Sathish Narayanan and R.Kala, Radio Mean Number Of Some Wheel Related Graphs, Jordan Journal of Mathematics and Statistics (JJMS) 7(4), 2014, pp.273 – 286.

[18] M. T. Rahim, I. Tomescu, OnMulti-level distance labelings of Helm Graphs, accepted for publication in ArsCombinatoria.

[19] Reddy Babu, D., Varma, P.L.N., Average D-Distance Between Edges Of A Graph ,Indian Journal of Science and Technology, Vol 8(2), 152–156, January 2015.

[20] Reddy Babu, D., Varma, P.L.N.,Average D-Distance Between Vertices Of A Graph , Italian Journal Of Pure And Applied Mathematics - N. 33¡2014 (293¡298).

[21] Reddy Babu, D., Varma, P.L.N., D-distance in graphs, Golden Research Thoughts, 2 (2013), 53-58.

[22] M. M. Rivera, M. Tomova, C. Wyels, and A. Yeager, The Radio Number of Cn □Cn,re submitted to Ars Combinatoria, 2009.

T. Nicholas, K.John Bosco, "Radio mean D-distance number of cycle-related graphs," *International Journal of Mathematics Trends and Technology (IJMTT)*, vol. 40, no. 3, pp. 247-251, 2016. *Crossref*, https://doi.org/10.14445/22315373/IJMTT-V40P530