On regular graphs optimally labeled with A condition at distance two

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 2, 2003, Pages 320-331

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

^a TRINITY COLLEGE   (United States)

Author keywords

L(j, k) labeling; Prism; Regular graph

Indexed keywords

CARTESIAN PRODUCTS; L(J, K)-LABELING; REGULAR GRAPHS;

MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 2542461499     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101391247     Document Type: Article

References (20)

1. G. J. CHANG, W.-T. KE, D. KUO, D. LIU, AND R. YEH, On L(d, 1)-labelings of graphs, Discrete Math., 220 (2000), pp. 57-66.
2. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
3. G. CHARTRAND, D.J. ERWIN, F. HARARY, AND P. ZHANG, Radio labelings of graphs, Bull. Inst. Combin. Appl., 33 (2001), pp. 77-85.
4. J. P. GEORGES AND D. W. MAURO, Labeling trees with a condition at distance two, Discrete Math., 269 (2003), pp. 127-148.
5. j,k-numbers of products of complete graphs, Congr. Numer., 140 (1999), pp. 141-160.
6. J. P. GEORGES AND D. W. MAURO, On the size of graphs labeled with a condition at distance two, J. Graph Theory, 22 (1996), pp. 47-57.
7. J. P. GEORGES AND D. W. MAURO, Generalized vertex labelings with a condition at distance two, Congr. Numer., 109 (1995), pp. 141-159.
8. J. P. GEORGES, D. W. MAURO, AND M. I. STEIN, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math., 14 (2000), pp. 28-35.
9. J. P. GEORGES, D. W. MAURO, AND M. A. WHITTLESEY, Relating path coverings to vertex labelings with a condition at distance two, Discrete Math., 135 (1994), pp. 103-111.
10. J. P. GEORGES AND D. W. MAURO, On the criticality of graphs labeled with a condition at distance two, Congr. Numer., 101 (1994), pp. 33-49.
11. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
12. W. K HALE, Frequency assignment: Theory and application, Proc. IEEE, 68 (1980), pp. 1497-1514.
13. P. JHA, Optimal L(2, 1)-Labeling of Kronecker Products of Certain Cycles, preprint, Universiti Multimedia Telekom, Malaysia.
14. P. JHA, A. NARAYANAN, P. SOOD, K. SUNDARAM, AND V. SUNDER, L(2, 1)-labeling of the Cartesian product of a cycle and a path, Ars Combin., 55 (2000), pp. 81-89.
15. D. KUO AND J. H. YAN, On L(2, 1)-labelings of Cartesian products of paths and cycles, Discrete Math., to appear.
16. D. LIU AND R. YEH, On distance two labelings of graphs, Ars Combin., 47 (1997), pp. 13-22.
17. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
18. J. VAN DEN HEUVEL, R. A. LEESE, AND M. A. SHEPHERD, Graph labeling and radio channel assignment, J. Graph Theory, 29 (1998), pp. 263-283.
19. n and related graphs, SIAM J. Discrete Math., 8 (1995), pp. 499-506.
20. P. ZHANG, Radio labelings of cycles, Ars Combin., 65 (2002), pp. 21-32.