On L(2,1) -labelings of Cartesian products of paths and cycles

Discrete Mathematics

Volumn 283, Issue 1-3, 2004, Pages 137-144

  Kuo, David ^a   Yan, Jing Ho ^b  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

^b ALETHEIA UNIVERSITY   (Taiwan)

Author keywords

Cartesian product; Cycle; L(2,1) labeling; L(2,1) labeling number; Path

Indexed keywords

FUNCTIONS; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CARTESIAN PRODUCT; CYCLE; L(2,1)-LABELING; L(2,1)-LABELING NUMBER; PATH;

GRAPH THEORY;

EID: 2442685837     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.11.009     Document Type: Article

References (27)

1. G.J. Chang, J.-J. Chen, D. Kuo, S.-C. Liaw, L(d,1) -labelings of digraphs, submitted for publication.
2. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., Yeh R.K. On. L(d,1) -labelings of graphs Discrete Math. 220:2000;57-66.
3. Chang G.J., Kuo D. The. L(2,1) -labeling on graphs SIAM J. Discrete Math. 9:1996;309-316.
4. Chang G.J., Liaw S.-C. The. L(2,1) -labeling problem on ditrees Ars Combin. 66:2003;23-31.
5. Chang G.J., Lu C. Distance-two labelings of graphs. European J. Combin. 24:2003;53-58.
6. Fiala J., Kloks T., Kratochvil J. Fixed-parameter complexity of. λ -labelings Discrete Appl. Math. 113:2001;59-72.
7. Georges J., Mauro D.W. On the criticality of graphs labelled with a condition at distance two. Congr. Numer. 101:1994;33-49.
8. Georges J., Mauro D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 109:1995;141-159.
9. Georges J., 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., Mauro D.W., Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14:2000;28-35.
12. Georges J., Mauro D., Whittlesey M. Relating path covering to vertex labellings with a condition at distance two. Discrete Math. 135:1994;103-111.
13. Griggs J.R., Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5:1992;586-595.
14. Hale W.K. Frequency assignment. theory and applications Proc. IEEE. 68:1980;1497-1514.
15. van den Heuvel J., Leese R.A., Shepherd M.A. Graph labeling and radio channel assignment. J. Graph Theory. 29:1998;263-283.
16. 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.
17. Jha P.K., Narayanan A., Sood P., Sundaram K., Sunder V. On. L(2,1) -labeling of the Cartesian product of a cycle and a path Ars Combin. 55:2000;81-89.
18. Liu D.D.-F. Hamiltonicity and circular distance two labelings. Discrete Math. 232:2001;163-169.
19. Liu D.D.-F. Sizes of graphs with fixed orders and spans for circular-distance-two labelings. Ars Combin. 67:2003;125-139.
20. Liu D.D.-F., Yeh R.K. On distance-two labellings of graphs. Ars Combin. 47:1997;13-22.
21. Liu D.D.-F., Zhu X. Circular distance two labeling and circular chromatic number. Ars Combin. 69:2003;177-183.
22. F.S. Roberts, Private communication through J. Griggs (1988).
23. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7:1994;133-140.
24. C. Schwarz, D.S. Troxell, L(2,1) -labeling of products of two cycles, submitted for publication.
25. n and related graphs SIAM J. Discrete Math. 8:1995;499-506.
26. Wu K.-F., Yeh R.K. Labeling graphs with the circular difference. Taiwanese J. Math. 4:2000;397-405.
27. Yeh R.K. The edge span of distance two labelings of graphs. Taiwanese J. Math. 4:2000;675-683.