The edge span of distance two labellings of graphs

Taiwanese Journal of Mathematics

Volumn 4, Issue 4, 2000, Pages 675-683

  Yeh, Roger K ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Edge span; Graph distance; Graph labelling; Radio channel assignment

Indexed keywords

EID: 0038748970     PISSN: 10275487     EISSN: None     Source Type: Journal    
DOI: 10.11650/twjm/1500407301     Document Type: Article

References (14)

1. G. J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996), 309-316.
2. G. J. Chang, W.-T. Ke, D. Kuo, D. D.-F. Liu and R. K. Yeh, On L(d, 1)-labelings of graphs, Discrete Math. 220 (2000), 57-66.
3. J. Georges, D. Mauro and M. Whittlesey, Relating path covering to vertex labellings with a condition at distance two, Discrete Math. 135 (1994), 103-111.
4. J. Georges and D.W. Mauro, Generalized vertex labellings with a condition at distance two, Congr. Numer. 109 (1995), 141-159.
5. J. Georges and D. W. Mauro, On size of graphs labeled with a condition at distance two, J. Graph Theory 22 (1996), 47-57.
6. J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992), 586-595.
7. W. K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980), 1497-1415.
8. J. van den Heuvel, R. A. Leese and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory 29 (1998), 263-283.
9. K.-C. Huang, private communication, 1997.
10. K. Jonas, Graph Coloring Analogues With a Condition at Distance Two: L(2,1)-Labelings and List λ-Labelings, Ph.D. Thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC, 1993.
11. D. Liu and R. K. Yeh, On distance two labellings of graphs, Ars Combin. 47 (1997), 13-22.
12. R. S. Roberts, private communication through J. Griggs, 1988.
13. D. Sakai, Labeling chordal graphs with a condition at distance two, SIAM J. Discrete Math. 7 (1994), 133-140.
14. n and related graphs, SIAM J. Discrete Math. 8 (1995), 499-506.