L(j, k)-Labelings of Kronecker products of complete graphs

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 55, Issue 1, 2008, Pages 70-73

  Haque, Md Enamul ^a   Jha, Pranava K ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Complete graph; Frequency allocation; Graph theory; Interchannel interference; Kronecker product; kj labeling

Indexed keywords

FREQUENCY ALLOCATION; RADIO TRANSMISSION;

ADJACENT VERTICES; COMPLETE GRAPHS; GRAPH G; INTERCHANNEL INTERFERENCE; KRONECKER PRODUCT; L (J , K) LABELING; LABELINGS; POSITIVE INTEGERS;

GRAPH THEORY;

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

References (15)

1. S. S. Adams, J. Cass, and D. S. Troxell, "An extension of the channel-assignment problem L(2; 1)-labelings of generalized petersen graphs," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 5, pp. 1101-1107, May 2006.
2. S. Aggarwal, P. K. Jha, and M. Vikram, "Distance regularity in direct-product graphs," Appl. Math. Lett., vol. 13, no. 1, pp. 51-55, Jan. 2000.
3. R. Balakrishnan, J.-C. Bermond, P. Paulraja, and M.-L. Yu, "On hamilton cycle decompositions of the tensor product of complete graphs," Discr. Math., vol. 268, no. 1-3, pp. 49-58, Jul. 2003.
4. J. P. Georges and D. W. Mauro, "Generalized vertex labelings with a condition at distance two," Congr. Numer., vol. 109, pp. 141-159, 1995.
5. 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, no. 1, pp. 28-35, 2000.
6. J. P. Georges, D. W. Mauro, and M. A. Whittlesey, "Relating path coverings to vertex labellings with a condition at distance two," Discr. Math., vol. 135, no. 1-3, pp. 103-111, Dec. 1994.
7. J. R. Griggs and R. K. Yeh, "Labelling graphs with a condition at distance two," SIAM J. Discr. Math., vol. 5, no. 4, pp. 586-595, 1992.
8. W. K. Hale, "Frequency assignment: Theory and applications," Proc. IEEE, vol. 68, pp. 1497-1514, 1980.
9. W. Imrich and S. Klavẑar, Product Graphs: Structure and Recognition. New York: Wiley, 2000.
10. 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.
11. 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.
12. P. K. Jha, S. Klavẑar, and A. Vesel, "Optimal L (d; 1 -labelings of certain direct products of cycles and Cartesian products of cycles," Discr. Appl. Math., vol. 152, no. 1-3, pp. 257-265, Nov. 2005.
13. K. Jonas, "Graph Coloring Analogues with a Condition at Distance Two L(2; 1)-Labellings and List γ-Labellings," Ph.D. dissertation, Dept. Math., Univ. of South Carolina, Columbia, 1993.
14. S. Klavẑar and Ŝpacapan, "The ∠ -conjecture is true for direct and strong products of graphs," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 53, no. 4, pp. 274-277, Apr. 2006.
15. F. S. Roberts, "T-colorings of graphs: Recent results and open problems," Discr. Math., vol. 93, no. 2-3, pp. 229-245, Nov. 1991.