L (2, 1)-Labelings on the composition of n graphs

Theoretical Computer Science

Volumn 411, Issue 34-36, 2010, Pages 3287-3292

  Shao, Zhendong ^a   Solis Oba, Roberto ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Channel assignment; Graph composition; L (2, 1) labeling

Indexed keywords

CHANNEL ASSIGNMENT; GENERAL GRAPH; GRAPH COMPOSITION; GRAPH G; L(2 , 1)-LABELING; LABELINGS; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; TWO-GRAPHS; VERTEX SET;

GRAPHIC METHODS; LABELING; THEOREM PROVING;

GRAPH THEORY;

EID: 77955430221     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.03.013     Document Type: Article

References (22)

1. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen λ-coloring of graphs Lecture Notes in Computer Science vol. 1770 2000 Springer-Verlag Berlin, Heidelberg 395 406
2. T. Calamoneri The L (h, k )-labelling problem: a survey and annotated bibliography Comput. J. 49 2006 585 608
3. G.J. Chang, W.-T. Ke, D. Kuo, D.D.-F. Liu, and R.K. Yeh On L (d, 1 )-labelings of graphs Discrete Math. 220 2000 57 66
4. G.J. Chang, and D. Kuo The L (2, 1 )-labeling on graphs SIAM J. Discrete Math. 9 1996 309 316
5. J. Fiala, T. Kloks, and J. Kratochvl Fixed-parameter complex of λ-labelings Lecture Notes in Computer Science vol. 1665 1999 Springer-Verlag Berlin, Heidelberg 350 363
6. N. Funabiki, and Y. Takefuji A neural network parallel algorithm for channel assignment problem in cellular radio networks IEEE Trans. Veh. Technol. 41 1992 430 437
7. J. Georges, D.W. Mauro, and M.I. Stein Labeling products of complete graphs with a condition at distance two SIAM J. Discrete Math. 14 2000 28 35
8. J. Georges, D.W. Mauro, and M. Whittlesey Relating path covering to vertex labelings with a condition at distance two Discrete Math. 135 1994 103 111
9. J.R. Griggs, and R.K. Yeh Labeling graphs with a condition at distance two SIAM J. Discrete Math. 5 1992 586 595
10. W.K. Hale Frequency assignment: theory and application Proc. IEEE 68 1980 1497 1514
11. S. Klavzar, and S. Spacapan The Δ 2-conjecture for L (2, 1 )-labelings is true for direct and strong products of graphs IEEE Trans. Circuits Syst. II 53 2006 274 277
12. D. Krl', and R. Skrekovski A theorem about channel assignment problem SIAM J. Discrete Math. 16 2003 426 437
13. N. Kunz Channel assignment for cellular radio using neural networks IEEE Trans. Veh. Technol. 40 1992 188 193
14. W.K. Lai, and G.G. Coghill Channel assignment through evolutionary optimization IEEE Trans. Veh. Technol. 45 1996 91 96
15. R. Mathar Channel assignment in cellular radio networks IEEE Trans. Veh. Technol. 42 1993 647 656
16. D. Sakai Labeling chordal graphs with a condition at distance two SIAM J. Discrete Math. 7 1994 133 140
17. C. Schwarz, and D. Sakai Troxell L (2, 1 )-labelings of products of two cycles Disc. Appl. Math. 154 2006 1522 1540
18. Z. Shao, S. Klavar, W.C. Shiu, and D. Zhang Improved bounds on the L (2, 1 )-number of direct and strong products of graphs IEEE Trans. Circuits Syst. II 55 7 2008 685 689
19. Z. Shao, and R.K. Yeh The L (2, 1 )-labeling and operations of graphs IEEE Trans. Circuits Syst. I 52 2005 668 671
20. Z. Shao, and D. Zhang Improved bounds on the L (2, 1 )-labeling of the skew and converse skew products of graphs Theoret. Comput. Sci. 400 13 2008 230 233
21. W.C. Shiu, Z. Shao, K.K. Poon, and D. Zhang A new approach to the L (2, 1 )-labeling of some products of graphs IEEE Trans. Circuits Syst. II 55 8 2008 802 805
22. R.K. Yeh, Labelling graphs with a condition at distance two, Ph.D. thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC, USA, 1990.