Distance-two labelings of graphs

European Journal of Combinatorics

Volumn 24, Issue 1, 2003, Pages 53-58

  Chang, Gerard J ^a   Lu, Changhong ^b,c  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b HUNAN NORMAL UNIVERSITY   (China)

^c EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

Algorithm; Degree; Distance; Labeling; Neighbor; Star; Tree

Indexed keywords

EID: 0037281452     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(02)00134-8     Document Type: Article

References (20)

1. 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
2. Chang G.J. Kuo D. The L(2,1)-labeling on graphs SIAM J. Discrete Math. 9 1996 309-316
3. G.J. Chang, S.-C. Liaw, The L(2,1)-labeling problem on ditrees, Ars Combin. (accepted)
4. Georges J. Mauro D.W. On the criticality of graphs labeled with a condition at distance two Congr. Numer. 101 1994 33-49
5. Georges J. Mauro D.W. Generalized vertex labelings with a condition at distance two Congr. Numer. 109 1995 141-159
6. Georges J. Mauro D.W. On the size of graphs labeled with a condition at distance two J. Graph Theory 22 1996 47-57
7. j-numbers of the products of complete graphs Congr. Numer. 140 1999 141-160
8. Georges J. Mauro D.W. Whittlesey M. Relating path covering to vertex labelings with a condition at distance two Discrete Math. 135 1994 103-111
9. Griggs J.R. 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 applications Proc. IEEE 68 1980 1497-1514
11. van den Heuvel J. Leese R.A. Shepherd M.A. Graph labeling and radio channel assignment J. Graph Theory 29 1998 263-283
12. Jha P.K. Optimal L(2,1)-labeling of Cartesian products of cycles with an application to independent domination IEEE Trans. Circuits Syst. I 47 2000 1531-1534
13. 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
14. Liu D.D.-F. Yeh R.K. On distance-two labelings of graphs Ars Combin. 47 1997 13-22
15. Nesetril J. Aspects of structural combinatorics (graph homomorphisms and their use) Taiwanese J. Math. 3 1999 381-423
16. F.S. Roberts, Private communication through J. Griggs (1988)
17. Sakai D. Labeling chordal graphs with a condition at distance two SIAM J. Discrete Math. 7 1994 133-140
18. n and related graphs SIAM J. Discrete Math. 8 1995 499-506
19. Wu K.-F. Yeh R.K. Labeling graphs with the circular difference Taiwanese J. Math. 4 2000 397-405
20. R.K. Yeh, The edge span of distance two labelings of graphs, Taiwanese J. Math. 4 (2000) 675-683.