Labeling trees with a condition at distance two

Discrete Mathematics

Volumn 269, Issue 1-3, 2003, Pages 127-148

  Georges, John P ^a   Mauro, David W ^a  

^a TRINITY COLLEGE   (United States)

Author keywords

j,k labeling; Infinite regular tree; Vertex labeling

Indexed keywords

GRAPH THEORY;

LABELING TREES;

TREES (MATHEMATICS);

EID: 0038480143     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00750-1     Document Type: Article

References (16)

1. G.J. Chang, Wen-Tsai Ke, D. Kuo, D. Liu, R. Yeh, On L(d, 1)-labelings of graphs, Discrete Math. 220 (2000) 57-66.
2. G.J. Chang, D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996) 309-316,
3. J.P. Georges, D.W. Mauro, On the criticality of graphs labeled with a condition at distance two, Congr. Numer. 101 (1994)33-49.
4. J.P. Georges, D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congr. Numer. 109 (1995) 141-159.
5. J.P. Georges, D.W. Mauro, On the size of graphs labeled with a condition at distance two, J. Graph Theory 22 (1996) 47-57.
6. j-numbers of products of complete graphs, Congr. Numer. 140 (1999) 141-160.
7. J.P, Georges, D.W. Mauro, On regular graphs optimally labeled with a condition at distance two, preprint.
8. J.P. Georges, D.W. Mauro, M.I. Stein, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math. 14 (2000) 28-35.
9. J.P. Georges, D.W. Mauro, M.A. Whittlesey, Relating path coverings to vertex labelings with a condition at distance two, Discrete Math. 135 (1994) 103-111.
10. J.R. Griggs, R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discrete Math. 5 (1992) 586-595.
11. W.K. Hale, Frequency assignment: theory and application, Proc. 14.4 68 (1980) 1497-1514.
12. P. Jha, A. Narayanan, P. Sood, K. Sundaram, V. Sunder, L(2, 1)-labeling of the cartesian product of a cycle and a path, Ars Combin. 55 (2000) 81-89.
13. D. Liu, R.K. Yeh, On distance two labelings of graphs, Ars Combin. 47 (1997) 13-22.
14. D. Sakai, Labeling chordal graphs: distance two condition, SIAM J. Discrete Math. 7 (1994) 133-140.
15. J. Van Den Heuvel, R.A. Leese, M.A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory 29 (1998) 263-283.
16. M.A. Whittlesey, J.P. Georges, D.W. Mauro, On the, λ-number of Qn and related graphs, SIAM J. Discrete Math 8 (1995) 499-506.