Graph distance-dependent labeling related to code assignment in computer networks

Naval Research Logistics

Volumn 52, Issue 2, 2005, Pages 159-164

  Jin, Xiaohua Teresa ^a   Yeh, Roger K ^b  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Code assignment; Distance; Graph labeling

Indexed keywords

CODE ASSIGNMENTS; DISTANCE; GRAPH LABELING; PACKET RADIO NETWORK;

CODES (SYMBOLS); GRAPH THEORY; INTEGER PROGRAMMING; NUMBER THEORY; PACKET NETWORKS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPUTER NETWORKS;

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

References (22)

1. A.A. Bertossi and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans Networking 3 (1995), 441-449.
2. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen, λ-coloring of graphs, Lecture Notes in Computer Science 1770, Springer-Verlag, Berlin, Heidelberg, 2000, pp. 395-406.
3. R.E. Broadhurst, W.J. Shanahan, and M.D. Steffen, We're sorry, you are outside the coverage area, J Undergraduate Math Appl 21(3) (2000), 327-342.
4. 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.
5. G.J. Chang and D. Kuo, The L(2, 1)-labeling on graphs, SIAM J Discrete Math 9 (1996), 309-316.
6. A. Gamst, Homogeneous distribution of frequencies in a regular hexagonal cell system, IEEE Trans Vehicular Technol VT-31 (1982), 132-144.
7. J. Georges and D.W. Mauro, On the criticality of graphs labelled with a condition at distance two, Congr Numer 101 (1994), 33-49.
8. J. Georges and D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congr Numer 109 (1995), 141-159.
9. J. Georges and D.W. Mauro, On the size of graphs labeled with a condition at distance two, J Graph Theory 22 (1996), 47-57.
10. j-numbers of the products of complete graphs, Congr Numer 140 (1999), 141-160.
11. J. Georges, D.W. Mauro, and M. Whittlesey, Relating path covering to vertex labelings with a condition at distance two, Discrete Math 135 (1994), 103-111.
12. J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J Discrete Math 5 (1992), 586-595.
13. W.K. Hale, Frequency assignment: theory and applications, Proc IEEE 68 (1980), 1497-1514.
14. J. van den Heuvel, R.A. Leese, and M.A. Shepherd, Graph labeling and radio channel assignment, J Graph Theory 29 (1998), 263-283.
15. P.K. Jha, A. Narayanan, P. Sood, K. Sundaram, and V. Sunder, On L(2, 1)-labeling of the Caresian product of a cycle and a path, Ars Combin 55 (2000), 81-89.
16. D.D.-F. Liu and R.K. Yeh, On distance-two labelings of graphs, Ars Combin 47 (1997), 13-22.
17. D. Sakai, Labeling chordal graphs with a condition at distance two, SIAM J Discrete Math 7 (1994), 133-140.
18. A. Sen, T. Roxborough, and S. Medidi, Upper and lower bounds of a class of channel assignment problems in cellular networks, Technical Report, Arizona State University, Tempe, 1997.
19. n and related graphs, SIAM J Discrete Math 8 (1995), 499-506.
20. K.-F. Wu and R.K. Yeh, Labeling graphs with the circular difference, Taiwanese J Math 4 (2000), 397-405.
21. R.K. Yeh, Labeling Graphs with a Condition at Distance Two, Ph.D. thesis, Department of Mathematics, University of South Carolina, 1990.
22. R.K. Yeh, The edge span of distance two labelings of graphs, Taiwanese J Math 4 (2000), 675-683.