The L (2, 1)-labeling on graphs and the frequency assignment problem

Applied Mathematics Letters

Volumn 21, Issue 1, 2008, Pages 37-41

  Shao, Zhendong ^a   Yeh, Roger K ^b   Zhang, David ^c  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b FENG CHIA UNIVERSITY   (Taiwan)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Channel assignment; L (2, 1) labeling; Total graph

Indexed keywords

BOUNDARY CONDITIONS; PROBLEM SOLVING; SET THEORY;

CHANNEL ASSIGNMENT; TOTAL GRAPH;

GRAPH THEORY;

EID: 36248953164     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2006.08.029     Document Type: Article

References (21)

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. Bertossi A.A., and Pinotti C.M. Mapping for conflict-free access of path in bidimensional arrays, circular lists, and complete trees. J. Parallel Distrib. Comput. 62 (2002) 1314-1333
3. 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
4. Chang G.J., and Kuo D. The L (2, 1)-labeling on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
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. Georges J., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 109 (1995) 141-159
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. Harary F. Graph Theory (1969), Addison-Wesley, Reading, MA
12. Jensen T.R., and Toft B. Graph Coloring Problem (1995), John Wiley & Sons, New York, NY
13. Jha P.K., Narayanan A., Sood P., Sundaram K., and Sunder V. On L (2, 1)-labeling of the Cartesian product of a cycle and a path. Ars Combin. 55 (2000) 81-89
14. Král' D., and S ̌krekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
15. Kuo D., and Yan J.-H. On L (2, 1)-labeling of Cartesian products of paths and cycles. Discrete Math. 283 1-3 (2004) 137-144
16. Liu D.D.-F., and Yeh R.K. On distance-two labelings of graphs. Ars Combin. 47 (1997) 13-22
17. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
18. Shao Z., and Yeh R.K. The L (2, 1)-labeling and operations of graphs. IEEE Trans. Circuits & Systems I: Regular Papers 52 (2005) 668-671
19. Shao Z., and Yeh R.K. The L (2, 1)-labeling on planar graphs. Appl. Math. Lett. 20 (2007) 222-226
20. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
21. 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