On L (d, 1)-labeling of Cartesian product of a cycle and a path

Discrete Applied Mathematics

Volumn 156, Issue 15, 2008, Pages 2867-2881

  Chiang, Shih Hu ^a   Yan, Jing Ho ^a  

^a ALETHEIA UNIVERSITY   (Taiwan)

Author keywords

Cartesian product; Chromatic number; Cycle; k L (d, 1) labeling; Path; Power

Indexed keywords

CARTESIAN PRODUCT; CARTESIAN PRODUCTS; CHROMATIC NUMBER; CYCLE; GRAPH G; K - L (D, 1)-LABELING; PATH; POWER; VERTEX SETS;

LABELING;

EID: 53049097915     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.11.019     Document Type: Article

References (31)

1. G.J. Chang, J.-J. Chen, D. Kuo, S.-C. Liaw, Distance-two labelings of digraphs, Discrete Appl. Math., in press (doi:10.1016/j.dam.2006.11.001)
2. Chang G.J., Ke W.-T., Kuo D., Lin 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 Liaw S.-C. The L(2,1)-labeling problem on ditrees. Ars Combin. 66 (2003) 23-31
5. Chang G.J., and Lu C. Distance-two labeling of graphs. European J. Combin. 24 (2003) 53-58
6. Fiala J., Kloks T., and Kratochvil J. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 133 (2001) 59-72
7. Georges J., and Mauro D.W. On the criticality of graphs labelled with a condition at distance two. Congr. Numer. 101 (1994) 33-49
8. Georges J., and Mauro D.W. Generalized vertex labeling with a condition at distance two. Congr. Numer. 109 (1995) 141-159
9. Georges J., and Mauro D.W. On the size of graphs labeled with a condition at distance two. J. Graph Theory 22 (1996) 47-57
10. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
11. Georges J., and Mauro D.W. On generalized Petersen graphs labeled with a condition at distance two. Discrete Math. 259 (2002) 311-318
12. Georges J., and Mauro D.W. On regular graphs optimally labeled with a condition at distance two. SIAM J. Discrete Math. 17 2 (2003) 320-331
13. 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
14. Georges J., Mauro D.W., and Whittlesey M. Relating path covering to vertex labellings with a condition at distance two. Discrete Math. 135 (1994) 103-111
15. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
16. Hale W.K. Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497-1514
17. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel assignment. J. Graph Theory 29 (1998) 263-283
18. 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 path. Ars Combin. 55 (2000) 81-89
19. Jha P.K. Optimal L (2, 1)-labeling of Cartesian products of cycles with an application to independent domination. IEEE Trans. Circuits Systems I: Fundamental Theory Appl. 47 (2000) 1531-1534
20. Klavžar S., and Vesel A. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers. Discrete Appl. Math. 129 (2003) 449-460
21. Kuo D., and Yan J.H. On L(2,1)-labelings of Cartesian products of paths and cycles. Discrete Math. 283 (2004) 137-144
22. Liu D.D.-F. Hamiltonicity and circular distance two labelings. Discrete Math. 232 (2001) 163-169
23. Liu D.D.-F. Sizes of graphs with fix order and spans for circular distance-two labelings. Ars Combin. 67 (2003) 129-139
24. Liu D.D.-F., and Yeh R.K. On distance-two labelings of graphs. Ars Combin. 47 (1997) 13-22
25. Liu D.D.-F., and Zhu X. Circular distance two labeling and the λ-number for outerplanar graphs. SIAM J. Discrete Math. 19 2 (2005) 281-293
26. F.S. Roberts, Private communication through J. R. Griggs (1988)
27. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
28. Schwarz C., and Troxell D.S. L (2, 1)-labeling of products of two cycles. Discrete Appl. Math. 154 (2006) 1522-1540
29. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
30. Wu K.-F., and Yeh R.K. Labeling graphs with the circular difference. Taiwanese J. Math. 4 (2000) 397-405
31. Yeh R.K. The edge span of distance two labeling of graphs. Taiwanese J. Math. 4 (2000) 675-683