Real number graph labellings with distance conditions

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 2, 2006, Pages 302-327

  Griggs, Jerrold R ^a   Jin, Xiaohua Teresa ^a,b  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b University of Vermont   (United States)

Author keywords

Channel assignment; Generalized coloring; Graph labelling

Indexed keywords

CHANNEL ASSIGNMENT; GENERALIZED COLORING; GRAPH LABELLING;

CHANNEL ESTIMATION; DIFFERENTIATION (CALCULUS); INTEGER PROGRAMMING; MATHEMATICAL MODELS; SIGNAL INTERFERENCE; TRANSMITTERS;

GRAPH THEORY;

EID: 34247166461     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480105446708     Document Type: Article

References (30)

1. R. BABILON, V. JELÍNEK, D. KRÁ L', AND P. VALTR, Graph Labeling with Adjustable Weights, ITI Report 2004-226, Institute for Theoretical Computer Science, Prague, Czech Republic, submitted.
2. A. A. BERTOSSI AND M. A. BONUCCELLI, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans. Networking, 3 (Aug., 1995), pp. 441-449.
3. R. E. BROADHURST, W. J. SHANAHAN, AND M. D. STEFFEN, We're sorry, you're outside the coverage area, UMAP J., 21 (2000), pp. 327-342.
4. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
5. R. CHU, B. XIU, AND R. ZONG, Utilize the limited frequency resources efficiently, UMAP J., 21 (2000), pp. 343-356.
6. M. B. COZZENS AND F. S. ROBERTS, T-colorings of graphs and the channel assignment problem, Congr. Numer., 35 (1982), pp. 191-208.
7. D. J. DURAND, J. M. KLINE, AND K. M. WOODS, Groovin' with the big band(width), UMAP J., 21 (2000), pp. 357-367.
8. J. P. GEORGES AND D. W. MAURO, Generalized vertex labelings with a condition at distance two, Congr. Numer., 109 (1995), pp. 141-159.
9. J. P. GEORGES AND D. W. MAURO, On generalized Petersen graphs labeled with a condition at distance two, Discrete Math., 259 (2003), pp. 311-318.
10. J. P. GEORGES AND D. W. MAURO, Labeling trees with a condition at distance two, Discrete Math., 269 (2003), pp. 127-148.
11. J. GOODWIN, D. JOHNSTON, AND A. MARCUS, Radio channel assignments, UMAP J., 21 (2000), pp. 369-378.
12. J. R. GRIGGS, Judge's commentary: The outstanding channel assignment papers, UMAP J., 21 (2000), pp. 379-386.
13. J. R. GRIGGS AND X. T. JIN, Real number channel assignments with distance conditions, DIMACS Graph Coloring Workshop lecture, Oct., 2003, posted online at http://dimacs.rutgers.edu/Workshops/ GraphColor/slides.html.
14. J. R. GRIGGS AND X. T. JIN, Real Number Channel Assignments for Lattices, preprint, Sept., 2005, posted online at http://www.math.sc.edu/~griggs/.
15. J. R. GRIGGS AND X. T. JIN, Real Number Labelings for Paths and Cycles, preprint, Sept., 2005, posted online at http://www.math.sc.edu/~griggs/.
16. J. R. GRIGGS AND R. K.-C. YEH, labeling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
17. W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1514.
18. J. VAN DEN HEUVEL AND S. MCGUINNESS, Coloring the square of a planar graph, J. Graph Theory, 42 (2003), pp. 110-124.
19. X. T. JIN, Real Number Graph Labeling with Distance Conditions, Ph.D. dissertation, Math. Dept., University of South Carolina, Columbia, SC August, 2005.
20. X. T. JIN AND R. K. YEH, Graph distance-dependent labeling related to code assignment in computer networks, Naval Res. Logist., 52 (2005), pp. 159-164.
21. D. KRÁL' AND R. SKREKOVSKI, A theorem about the channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
22. R. A. LEESE, A unified approach to the assignment of radio channels to a regular hexagonal grid, IEEE Trans. Vehicular Tech., 46 (1997), pp. 969-980.
23. R. A. LEESE AND S. D. NOBLE, Cyclic labelings with constraints at two distances, Electron. J. Combin., 11 (2004), #R16, 16pp.
24. J. MINTZ, A. NEWCOMER, AND J. C. PRINCE, A channel assignment model: The span without a face, UMAP J., 21 (2000), pp. 311-326.
25. B. MOHAR, Circular Colorings of Edge-Weighted Graphs, J. Graph Theory, 43 (2003), pp. 107-116.
26. M. MOLLOY AND M. R. SALAVATIPOUR, Frequency channel assignment on planar networks, in Proceedings of the 10th Annual Europ. Sympos. Algorithms (ESA), 2002, pp. 736-747.
27. F. S. ROBERTS, Working Group Agenda, DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and their Generalizations, 2003, posted online at http://dimacs.rutgers.edu/Workshops/GraphColor/main.html.
28. D. SAKAI, Labelling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
29. R. K. YEH, Labeling Graphs with a Condition at Distance 2, Ph.D. dissertation, University of South Carolina, Columbia, SC, 1990.
30. D. ZHU AND A. SHI, Optimal Channel Assignments, personal communication, 2001.