The L(2, 1)-labeling and operations of graphs

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 52, Issue 3, 2005, Pages 668-671

  Shao, Zhendong ^a   Yeh, Roger K ^b  

^a NANJING UNIVERSITY   (China)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

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

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); SET THEORY; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

CHANNEL ASSIGNMENT; GRAPH CARTESIAN PRODUCT; GRAPH COMPOSITION;

GRAPH THEORY;

EID: 16344378111     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2004.840484     Document Type: Article

References (25)

1. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. V. Leeuwen, "λ-coloring of graphs," in Lecture Notes in Computer Science, 1770. Berlin, Germany: Springer-Verlag, pp. 395-4 062 000.
2. A. A. Bertossi and C. M. Pinotti, "Mapping for conflict-free access of path in bidimensional arrays, circular lists, and complete trees," J. Parall. Distrib. Comp., vol. 62, pp. 1314-1333, 2002.
3. G. J. Chang, W.-T. Ke, D. Kuo, D. D.-F. Liu, and R. K. Yeh, "On L(d, 1)-labelings of graphs," Discr. Math., vol. 220; pp. 57-66, 2000.
4. G. J. Chang and D. Kuo, "The L(2, 1)-labeling on graphs," in SIAM J. Discr. Math., vol. 9, 1996, pp. 309-316.
5. J. Fiala, T. Kloks, and J. Kratochvil, "Fixed-parameter complex of ,λ-labelings," in Lecture Notes in Computer Science, 1665. Berlin, Germany: Springer-Verlag, 1999, pp. 350-363.
6. J. Georges and D. W. Mauro, "Generalized vertex labelings with a condition at distance two," Congr. Numer., vol. 109, pp. 141-159, 1995.
7. J. Georges, D. W. Mauro, and M. I. Stein, "Labeling products of complete graphs with a condition at distance two," in SIAM J. Discr. Math., vol. 14, 2000, pp. 28-35.
8. J. Georges, D. W. Mauro, and M. Whittlesey, "Relating path covering to vertex labelings with a condition at distance two," Discr. Math., vol. 135, pp. 103-111, 1994.
9. J. R. Griggs and R. K. Yeh, "Labeling graphs with a condition at distance two," in SIAM J. Discr. Math., vol. 5, 1992, pp. 586-595.
10. W. K. Hale, "Frequency assignment: Theory and application," Proc. IEEE, vol. 68, no. [AU: please supply ISSUE NUMBER and MONTH?], pp. 1497-1514, 1980.
11. F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
12. P. K. Jha, "Optimal L(2, 1)-labelings of Cartesian products of cycles with an application to independent domination," IEEE Trans. Circuits Syst. I, Fundam.Theory Appl., vol. 47, no. 10, pp. 1531-1534, Oct. 2000.
13. P. K. Jha, "Optimal L(2, 1)-labeling of strong products of cycles," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 4, pp. 498-500, Apr. 2001.
14. P. K. Jha, A. Narayanan, P. Sood, K. Sundaram, and V. Sunder, "On L(2,1)-labeling of the Cartesian product of a cycle and a path," ARS Combin., vol. 55, pp. 81-89, 2000.
15. S. Klavar and A. Vesel, "Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers," Discr. Appl. Math., vol. 129, pp. 449-460, 2003.
16. D. Král and R. Škrekovski, "A theorem about channel assignment problem," in SIAMJ. Discr. Math., vol. 16, 2003, pp. 426-437.
17. D. Kuo and J.-H. Yan, "On L(2,1)-labeling of Cartesian products of paths and cycles," Discr. Math., to be published.
18. D. D.-F. Liu and R. K. Yeh, "On distance-two labelings of graphs," ARS Combin., vol. 47, pp. 13-22, 1997.
19. D. Sakai, "Labeling chordal graphs with a condition at distance two," in SIAM J. Discr. Math., vol. 7, 1994, pp. 133-140.
20. C. Schwarz and D. S. Troxell, "L(2, 1)-Labelings of Products of Two Cycles,", DIMACS Technical Report 2003-33, 2003.
21. Z. Skupien, "Path partitions of vertices and hamiltonicity of graphs," in Proc. 2nd Czech. Symp. Graph Theory, Prague, Czechslovakia, 1974.
22. D. B. West, Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2001.
23. n and related graphs," in SIAMJ. Discr. Math., vol. 8, 1995, pp. 499-506.
24. R. K. Yeh, "Labeling Graphs with a Condition at Distance Two," Ph.D. dissertation, Dept. Math., Univ. of South Carolina, Columbia, SC, 1990.
25. R. K. Yeh, "The edge span of distance two labelings of graphs," Taiw. J. Math., vol. 4, pp. 675-683, 2000.