Improved bounds on the L(2,1)-number of direct and strong products of graphs

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 55, Issue 7, 2008, Pages 685-689

  Shao, Zhendong ^a,b   Klavžar, Sandi ^c,d   Shiu, Wai Chee ^e   Zhang, David ^f  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c UNIVERSITY OF MARIBOR   (Slovenia)

^d INSTITUTE OF MATHEMATICS   (Slovenia)

^e HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^f HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Channel assignment; Graph direct product; Graph strong product; L(2, 1) labeling

Indexed keywords

COMBINATORIAL OPTIMIZATION; FREQUENCY ALLOCATION; RADIO TRANSMISSION; TRANSMITTERS;

CHANNEL ASSIGNMENT; DIRECT PRODUCT; FREQUENCY ASSIGNMENT PROBLEM; GRAPH DIRECT PRODUCT; GRAPH STRONG PRODUCT; L(2 , 1)-LABELING; NONNEGATIVE INTEGERS; STRONG PRODUCT;

GRAPH THEORY;

EID: 48849107345     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2008.921411     Document Type: Article

References (23)

1. S. S. Adams, J. Cass, and D. S. Troxell, "An Extension of the channel-assignment problem: Petersen L(2, 1)-labelings of generalized Petersen graphs," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 6, pp. 1101-1107, Jun. 2006.
2. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. v. Leeuwen, "λ-coloring of graphs," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2000, vol. 1770, pp. 395-406.
3. T. Calamoneri, "The L(k, k)-labelling problems: A survey and annotated bibliography," Comp. J., vol. 49, pp. 585-608, 2006.
4. G. J. Chang and D. Kuo, "The L(2, 1)-labeling on graphs," SIAM J. Discr. Math., vol. 9, pp. 309-316, 1996.
5. M. Duque-Anton, N. Kunz, and B. Ruber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Veh. Technol., vol. 42, no. 1, pp. 14-21, Jan. 1993.
6. J. Fiala, T. Kloks, and J. Kratochvíl, "Fixed-parameter complex of λ-labelings," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1999, vol. 1665, pp. 350-363.
7. N. Funabiki and Y. Takefuji, "A neural network parallel algorithm for channel assignment problem in cellular radio networks," IEEE Trans. Veh. Technol., vol. 41, no. 4, pp. 430-437, Apr. 1992.
8. D. Gonçcalves, "On the L(p, 1)-labelling of graphs," in Proc. 2005 Eur. Conf. Combinatorics, Graph Theory Appl. (EuroComb '05) S. Felsner, Ed., pp. 81-86.
9. J. R. Griggs and R. K. Yeh, "Labeling graphs with a condition at distance two," SIAM J. Discr. Math., vol. 5, pp. 586-595, 1992.
10. W. K. Hale, "Frequency assignment: Theory and application," Proc. IEEE, vol. 68, no. 6, pp. 1497-1514, Jun. 1980.
11. W. Imrich and S. Klavžar, Product Graphs: Structure and Recognition. New York: Wiley, 2000.
12. P. K. Jha, "Optimal L(2, 1)-labelings of Cartesian products of cycles with an application to independent domination," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 47, no. 12, pp. 1531-1534, Dec. 2000.
13. P. K. Jha, "Optimal L i(2.1)-labeling of strong product cycles," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 4, pp. 498-500, Apr. 2001.
14. 2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs," IEEE Trans. Circuits Syst. II, Exp. Breifs, vol. 53, no. 3, pp. 274-277, Mar. 2006.
15. N. Kunz, "Channel assignment for cellular radio using neural networks," IEEE Trans. Veh. Technol., vol. 40, no. 2, pp. 188-193, Feb. 1992.
16. D.Korže and A.Vesel, "L (2, 1)-labeling of strong products of cycles," Inf. Process. Lett., vol. 94, pp. 183-190, 2005.
17. D. Král' and R. Škrekovski, "A theorem about channel assignment problem," SIAM J. Discr. Math., vol. 16, pp. 426-437, 2003.
18. W. K. Lai and G. G. Coghill, "Channel assignment through evolutionary optimization," IEEE Trans. Veh. Technol., vol. 45, no. 1, pp. 91-96, Jan. 1996.
19. R. Mathar, "Channel assignment in cellular radio networks," IEEE Trans. Veh. Technol., vol. 42, no. 6, pp. 647-656, Jun. 1993.
20. F. S. Roberts, "T-colorings of graphs: Recent results and open problems," Discr. Math., vol. 93, pp. 229-245, 1991.
21. 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. 4 pp. 668-671, Apr. 2005.
22. K. W. Tang and S. A. Padubirdi, "Diagonal and toroidal mesh networks," IEEE Trans. Comput., vol. 43, no. 8, pp. 815-826, Aug. 1994.
23. 7," Inf. Proc. Lett., vol. 81, pp. 277-282, 2002.