The Δ2-Conjecture for L(2,1)-Labelings is True for Direct and Strong Products of Graphs

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 53, Issue 4, 2006, Pages 274-277

  Klavžar, Sandi ^a,b   Špacapan, Simon ^a,b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

channel assignment; graph direct product; graph strong product; L(2, 1) labeling

Indexed keywords

CHANNEL ESTIMATION; NUMBER THEORY; PROBLEM SOLVING;

CHANNEL ASSIGNMENT; GRAPH DIRECT PRODUCT; GRAPH STRONG PRODUCT; L(2, 1)-LABELING;

GRAPH THEORY;

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

References (21)

1. T. Bohman, “A limit theorem for the Shannon capacities of odd cycles. II,” Proc. Amer. Math. Soc., vol. 133, pp. 537–543, 2005.
2. T. Calamoneri, “The L(h, k) -labeling problem: A survey,” Dept. of Comp. Sci., Univ. of Rome “La Sapienza”, Rome, Italy, Tech. Rep. 04/2004.
3. G. J. Chang and D. Kuo, “The L(2,1)-labeling on graphs,” SIAM J. Discrete Math., vol. 9, pp. 309–316, 1996.
4. G. J. Chang and S.-C. Liaw, “The L(2,1)-labeling problem on ditrees,” Ars Combin., vol. 66, pp. 23–31, 2003.
5. P. C. Fishburn and F. S. Roberts, “No-hole L(2,1)-colorings,” Discr. Appl. Math., vol. 130, pp. 513–519, 2003.
6. S. L. Fitzpatrick and R. J. Nowakowski, “The strong isometric dimension of finite reflexive graphs,” Discuss. Math. Graph Theory, vol. 20, pp. 23–38, 2000.
7. 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.
8. 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.
9. W. K. Hale, “Frequency assignment: Theory and application,” Proc. IEEE, vol. 68, no. 7, pp. 1497–1514, Jul. 1980.
10. W. Imrich and S. Klavžar, Product Graphs: Structure and Recognition. New York: Wiley, 2000.
11. P. K. Jha, “Smallest independent dominating sets in Kronecker Kronecker products of cycles,” Discr. Appl. Math., vol. 113, pp. 303–306, 2001.
12. 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.
13. P. K. Jha, S. Klavžar, and A. Vesel, “L(2,1)-labeling of direct product of paths and cycles,” Discr. Appl. Math., vol. 145, pp. 317–325, 2005.
14. P. K. Jha, S. Klavžar, and B. Zmazek, “Isomorphic components of Kronecker product of bipartite graphs,” Discuss. Math. Graph Theory, vol. 17, pp. 301–309, 1997.
15. S. Klavžar and A. Vesel, “Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers,” Discr. Appl. Math., vol. 129, pp. 449–460, 2003.
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 the channel-assignment problem,” SIAM J. Discr. Math., vol. 16, pp. 426-437, 2003.
18. D. Kuo and J.-H. Yan, “On L(2,1)-labelings of Cartesian products of paths and cycles,” Discr. Math., vol. 283, pp. 137–144, 2004.
19. J. Ramirez and R. Melhem, “Computational arrays with flexible redundancy,” Computer, vol. 20, pp. 55–65, 1987.
20. 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, Mar. 2005.
21. K. W. Tang and S. A. Padubirdi, “Diagonal and toroidal mesh networks,” IEEE Trans. Comput., vol. 43, pp. 815–826, 1994.