Distance-two labelings of digraphs

Discrete Applied Mathematics

Volumn 155, Issue 8, 2007, Pages 1007-1013

  Chang, Gerard J ^a,b   Chen, Jer Jeong ^b,c   Kuo, David ^b,d   Liaw, Sheng Chyang ^b,e  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL CENTER FOR THEORETICAL SCIENCES   (Taiwan)

^c CHINA UNIVERSITY OF TECHNOLOGY   (Taiwan)

^d NATIONAL DONG HWA UNIVERSITY   (Taiwan)

^e NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Digraph; Ditree; Homomorphism; L (j, k) labeling

Indexed keywords

DIGRAPHS; DITREES; HOMOMORPHISM; L (J, K)-LABELING;

ALGORITHMS; INTEGER PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH THEORY;

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

References (30)

1. Bodlaender H.L., Kloks T., Tan R.B., and van Leeuwen J. λ-Coloring of graphs. Lecture Notes in Computer Science vol. 1770 (2000), Springer, Berlin 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 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 labelings of graphs. European J. Math. 24 (2003) 53-58
6. Fishburn P.C., and Roberts F.R. No hole L (2, 1)-colorings. Discrete Appl. Math. 130 (2003) 513-519
7. Fu{combining double acute accent}redi Z., Griggs J.R., and Kleitman D.J. Pair labellings with given distance. SIAM J. Discrete Math. 2 (1989) 491-499
8. Georges J., and Mauro D.W. Generalized vertex labelings 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. Georges J., and Mauro D.W. On generalized Petersen graphs labeled with a condition at distance two. Discrete Math. 259 (2002) 311-318
11. Georges J., and Mauro D.W. Labeling trees with a condition at distance two. Discrete Math. 269 (2003) 127-148
12. Georges J., and Mauro D.W. On regular graphs optimally labeled with a condition at distance two. SIAM J. Discrete Math. 17 (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 labelings 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 a path. Ars Combin. 55 (2000) 81-89
19. 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
20. Král D., and Škrekovski R. A theorem about the channel assignment problem. SIAM J. Discrete Math. 16 (2003) 426-437
21. Kuo D., and Yan J.-H. On L (2, 1)-labeling of Cartesian products of paths and cycles. Discrete Math. 283 (2004) 137-144
22. Liu D.D.-F. Hamiltonicity and circular distance two labellings. Discrete Math. 232 (2001) 163-169
23. Liu D.D.-F. Sizes of graphs with fixed ordered 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. Raychaudhuri A. Distance-2 labeling of strongly chordal graphs. Congr. Numer. 149 (2001) 55-63
26. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
27. Wang W.-F., and Lih K.-W. Labelling planar graphs with conditions on distance two. SIAM J. Discrete Math. 17 (2003) 264-275
28. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
29. Wu K.-F., and Yeh R.K. Labeling graphs with the circular difference. Taiwanese J. Math. 4 (2000) 397-405
30. Yeh R.K. The edge span of distance two labelings of graphs. Taiwanese J. Math. 4 (2000) 675-683