An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 53, Issue 5, 2006, Pages 1101-1107

  Adams, Sarah Spence ^a   Cass, Jonathan ^a   Troxell, Denise Sakai ^b  

^a FRANKLIN W OLIN COLLEGE OF ENGINEERING   (United States)

^b BABSON COLLEGE   (United States)

Author keywords

Channel assignment; Frequency allocation; Generalized Petersen graph; Graph theory; Interchannel interference; L(2, 1) labeling

Indexed keywords

CHANNEL CAPACITY; FREQUENCY ALLOCATION; GRAPH THEORY; INTERFERENCE SUPPRESSION; MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

CHANNEL ASSIGNMENT; GENERALIZED PETERSEN GRAPHS; INTERCHANNEL INTERFERENCE;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 33646517669     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2005.862184     Document Type: Article

References (20)

1. W. K. Hale, "Frequency assignment: Theory and applications," Proc. IEEE, vol. 68, no. 5, pp. 1497-1514, May 1980.
2. F. S. Roberts, "T-colorings of graphs: Recent results and open problems," in Discr. Math., vol. 93, 1991, pp. 229-245.
3. J. R. Griggs and R. K. Yeh, "Labeling graphs with a condition at distance two," SIAM J. Discr. Math., vol. 5, pp. 585-595, 1992.
4. T. Calamoneri. (2004) The L(h, k)-Labeling Problem: A Survey [Online]. Available: http://www.dsi.uniromal.it/~calamo/PDF-FILES/survey.pdf
5. N. Funabiki and Y. Takefuji, "A neural network parallel algorithm for channel-assignment problem in cellular radio networks," IEEE Trans. Vehic. Technol., vol. 41, no. 4, pp. 430-437, Nov. 1992.
6. N. Kunz, "Channel assignment for cellular radio using neural networks," IEEE Trans. Vehic. Technol., pt. 2, vol. 40, no. 1, pp. 188-193, Feb. 1991.
7. W. K. Lai and G. G. Coghill, "Channel assignment through evolutionary optimization," IEEE Trans. Vehic. Technol., vol. 45, no. 1, pp. 91-96, Feb. 1996.
8. R. Mathar, "Channel assignment in cellular radio networks," IEEE Trans. Vehic. Technol., vol. 42, no. 4, pp. 647-656, Nov. 1993.
9. M. Duque-Anton, N. Kunz, and B. Ruber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Vehic. Technol., vol. 42, no. 1, pp. 14-21, Feb. 1993.
10. J. P. Georges, D. W. Mauro, and M. A. Whittlesey, "Relating path coverings to vertex labelings with a condition at distance two," Discr. Math., vol. 135, pp. 103-111, 1994.
11. K. Jonas, "Graph Coloring Analogues with a Condition at Distance Two: L(2, 1)-Labelings and List λ-Labelings," Ph.D. dissertation, Univ. of South Carolina, Columbia, SC, 1993.
12. G. J. Chang and D. Kuo, "The L(2, 1)-labeling problem on graphs," SIAM J. Discr. Math., vol. 9, pp. 309-316, 1996.
13. D. Král and R. Skrekovski, "A theorem about the channel assignment," SIAM J. Discr. Math., vol. 16, pp. 426-437, 2003.
14. J. P. Georges, D. W. Mauro, and M. I. Stein, "Labeling products of complete graphs with a condition at distance two," SIAM J. Discr. Math., vol. 14, pp. 28-35, 2000.
15. P. K. Jha, "Optimal L(2, 1)-labeling of Cartesian products of cycles, with an application to independent domination," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 47, no. 10, pp. 1531-1534, Oct. 2000.
16. P. K. Jha, "Optimal L(2, 1)-labeling of strong products of cycles," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 4, pp. 498-500, Apr. 2001.
17. C. Schwartz and D. S. Troxell, "L(2, 1)-labelings of products of two cycles," Discr. Appl. Math., to be published.
18. Z. Shao and R. K. Yeh, "The L(2, 1)-labeling and operations of graphs," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 52, no. 3, pp. 668-671, Apr. 2005.
19. D. Sakai, "Labeling chordal graphs with a condition at distance two," SIAM J. Discr. Math., vol. 7, pp. 133-140, 1994.
20. J. P. Georges and D. W. Mauro, "On generalized petersen graphs labeled with a condition at distance two," Discr. Math., vol. 259, pp. 311-318, 2002.