Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs

Theoretical Computer Science

Volumn 400, Issue 1-3, 2008, Pages 230-233

  Shao, Zhendong ^a   Zhang, David ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Channel assignment; Graph converse skew product; Graph skew product; L (2, 1) labeling

Indexed keywords

INTEGER PROGRAMMING; LABELING; MATRIX ALGEBRA;

CHANNEL ASSIGNMENT; GRAPH CONVERSE SKEW PRODUCTS; GRAPH SKEW PRODUCTS;

GRAPH THEORY;

LABELING; MATRICES;

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

References (24)

1. Bodlaender H.L., Kloks T., Tan R.B., and Leeuwen J.v. λ-coloring of graphs. Lecture Notes in Computer Science vol. 1770 (2000), Springer-Verlag, Berlin, Heidelberg 395-406
2. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labelings of graphs. Discrete Math. 220 (2000) 57-66
3. Chang G.J., and Kuo D. The L (2, 1)-labeling on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
4. Chang G.J., and Lu C. Distance-two labelings of graphs. European J. Combin. 24 (2003) 53-58
5. Fiala J., Kloks T., and Kratochvíl J. Fixed-parameter complex of λ-labelings. Lecture Notes in Computer Science vol. 1665 (1999), Springer-Verlag, Berlin, Heidelberg 350-363
6. Funabiki N., and Takefuji Y. A neural network parallel algorithm for channel assignment problem in cellular radio networks. IEEE Trans. Vehicular Technol. 41 (1992) 430-437
7. Georges J., Mauro D.W., and Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
8. Georges J., Mauro D.W., and Whittlesey M. Relating path covering to vertex labelings with a condition at distance two. Discrete Math. 135 (1994) 103-111
9. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
10. Hale W.K. Frequency assignment: Theory and application. Proc. IEEE 68 (1980) 1497-1514
11. 2-conjecture for L (2, 1)-labelings is true for direct and strong products of graphs. IEEE Trans. Circuits Syst. II: Express Briefs 53 (2006) 274-277
12. Král' D., and S ̌krekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
13. Kunz N. Channel assignment for cellular radio using neural networks. IEEE Trans. Vehicular Technol. 40 (1992) 188-193
14. Lai W.K., and Coghill G.G. Channel assignment through evolutionary optimization. IEEE Trans. Vehicular Technol. 45 (1996) 91-96
15. Mathar R. Channel assignment in cellular radio networks. IEEE Trans. Vehicular Technol. 42 (1993) 647-656
16. Roberts F.S. T-colorings of graphs: Recent results and open problems. Discrete Math. 93 (1991) 229-245
17. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
18. Z. Shao, S. Klavžar, W.C. Shiu, D. Zhang, Improved bounds on the L (2, 1)-number of direct and strong products of graphs, IEEE Trans. Circuits Syst. II: Express Briefs (to appear)
19. Shao Z., and Yeh R.K. The L (2, 1)-labeling and operations of graphs. IEEE Trans. Circuits Syst. I: Regular Papers 52 (2005) 668-671
20. Shao Z., Yeh R.K., and Zhang D. The L (2, 1)-labeling on the skew and converse skew products of graphs. Appl. Math. Lett. 20 (2007) 59-64
21. W.C. Shiu, Z. Shao, K.K. Poon, D. Zhang, A new approach to the L (2, 1)-labeling of some products of graphs, IEEE Trans. Circuits Syst. II: Express Briefs (to appear)
22. Shibata Y., and Kikuchi Y. Graph products based on the distance in graphs. IEICE Trans. Fundamentals 3 E83-A (2000) 459-464
23. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
24. 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