Radio number for trees

Let G be a connected graph with diameter diam(G). The radio number for G, denoted by rn(G), is the smallest integer k such that there exists a function f:V(G)->{0,1,2,...,k} with the following satisfied for all vertices u and v: |f(u)-f(v)|>=diam(G)-d"G(u,v)+1, where d"G(u,v) is the distance between u and v. We prove a lower bound for the radio number of trees, and characterize the trees achieving this bound. Moreover, we prove another lower bound for the radio number of spiders (trees with at most one vertex of degree more than two) and characterize the spiders achieving this bound. Our results generalize the radio number for paths obtained by Liu and Zhu.

[1]  J. Georges,et al.  On the size of graphs labeled with condition at distance two , 1996 .

[2]  Denise Sakai,et al.  Labeling Chordal Graphs: Distance Two Condition , 1994 .

[3]  Ping Zhang,et al.  Radio Labelings of Cycles , 2002, Ars Comb..

[4]  Daniel Král,et al.  A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..

[5]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..

[6]  Xuding Zhu,et al.  Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs , 2005, SIAM J. Discret. Math..

[7]  Gary Chartrand,et al.  A graph labeling problem suggested by FM channel restrictions , 2005 .

[8]  Daphne Der-Fen Liu.  Hamiltonicity and circular distance two labellings , 2001, Discret. Math..

[9]  J. V. D. Heuvel,et al.  Graph labeling and radio channel assignment , 1998 .

[10]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[11]  John P. Georges,et al.  On the size of graphs labeled with a condition at distance two , 1996, J. Graph Theory.

[12]  Daphne Der-Fen Liu,et al.  Radio Number for Square Paths , 2009, Ars Comb..

[13]  Daphne Der-Fen Liu,et al.  On L(d, 1)-labelings of graphs , 2000, Discret. Math..

[14]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[15]  Frank Harary,et al.  Radio labelings of graphs , 2001 .

[16]  Xuding Zhu,et al.  Multilevel Distance Labelings for Paths and Cycles , 2005, SIAM J. Discret. Math..

[17]  Daphne Der-Fen Liu,et al.  Radio Number for Square of Cycles ∗ , 2004 .

[18]  John P. Georges,et al.  Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..