On labeling the vertices of products of complete graphs with distance constraints

Naval Research Logistics

Volumn 52, Issue 2, 2005, Pages 138-141

  Erwin, D J ^a   Georges, J P ^a   Mauro, D W ^a  

^a TRINITY COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE CONSTRAINTS; NONNEGATIVE INTEGERS; RADIO LABELING; VERTEX LABELING;

CONSTRAINT THEORY; FREQUENCIES; GRAPH THEORY; INTEGRAL EQUATIONS; RADIO TRANSMITTERS;

LABELING;

FREQUENCIES; LABELING; MATHEMATICAL ANALYSIS; RADIO; RESTRAINTS; TRANSMITTERS;

EID: 14644408754     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10080     Document Type: Article

References (16)

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. Chartrand, D.J. Erwin, F. Harary, and P. Zhang, Radio labelings of graphs, Bull Inst Combinat Appl 33 (2001), 77-85.
3. G. Chartrand, D.J. Erwin, and P. Zhang, A graph labeling problem suggested by FM channel restrictions, preprint.
4. J.P. Georges and D.W. Mauro, On the size of graphs labeled with a condition at distance two, J Graph Theory 22 (1996), 47-57.
5. J.P. Georges and D.W. Mauro, On the criticality of graphs labeled with a condition at distance two, Cong Numer 101 (1994), 33-49.
6. j,knumbers of products of complete graphs, Cong Numer 140 (1999), 141-160.
7. 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), 28-35.
8. 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), 103-111.
9. J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J Discrete Math 5 (1992), 586-595.
10. W.K. Hale, Frequency assignment: Theory and application, Proc IEEE 68 (1980), 1497-1514.
11. J. Van Den Heuvel, R.A. Leese, and M.A. Shepherd, Graph labeling and radio channel assignment, J Graph Theory 29 (1998), 263-283.
12. D. Liu and R.K. Yeh, On distance two labelings of graphs, Ars Combinat 47 (1997), 13-22.
13. F.S. Roberts, T-colorings of graphs: Recent results and open problems, Research Report RRR 7-86, RUTCOR, Rutgers University, New Brunswick, NJ, 1986.
14. F.S. Roberts, "From garbage to rainbows: Generalizations of graph colorings and their applications," Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (Editors), Wiley, New York, 1989, pp. 1031-1052.
15. D. Sakai, Labeling chordal graphs: distance two condition, SIAM J Discrete Math 7 (1994), 133-140.
16. n and related graphs, SIAM J Discrete Math 8 (1995), 499-506.