Discussiones Mathematicae Graph Theory 30(2) (2010)
201-222
doi: 10.7151/dmgt.1487
Ruxandra Marinescu-Ghemeci
Faculty of Mathematics and Computer Science
University of Bucharest
Str. Academiei, 14, 010014 Bucharest, Romania
e-mail: verman@fmi.unibuc.ro
Keywords: multilevel distance labeling, radio number, caterpillar, diameter.
2010 Mathematics Subject Classification: 05C15, 05C78.
[1] | F. Buckley and F. Harary, Distance in Graphs (Addison-Wesley Pub. Co., 1990). |
[2] | G. Chartrand, D. Erwin, F. Harary and P. Zhang, Radio labelings of graphs, Bull. Inst. Combin. Appl. 33 (2001) 77-85. |
[3] | G. Chartrand, D. Erwin and P. Zhang, A graph labeling problem suggested by FM channel restrictions, Bull. Inst. Combin. Appl. 43 (2005) 43-57. |
[4] | J.A. Gallian, A dynamic survey of graph labelings, Electronic J. Combinatorics 14 (2007) #DS6. |
[5] | I. Gutman, Distance of thorny graphs, Publ. Inst. Math. (Beograd) 63 (1998) 31-36. |
[6] | W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514, doi: 10.1109/PROC.1980.11899. |
[7] | D. Liu, Radio number for trees, Discrete Math. 308 (2008) 1153-1164, doi: 10.1016/j.disc.2007.03.066. |
[8] | D. Liu and X. Zhu, Multilevel distance labelings for paths and cycles, SIAM J. Discrete Math. 19 (2005) 610-621, doi: 10.1137/S0895480102417768. |
[9] | M.T. Rahim and I. Tomescu, Multilevel distance labelings for helm graphs, Ars Combinatoria, to appear. |
Received 12 November 2008
Revised 8 June 2009
Accepted 8 June 2009