The /spl Delta//sup 2/-conjecture for L(2,1)-labelings is true for direct and strong products of graphs

A variation of the channel-assignment problem is naturally modeled by L(2,1)-labelings of graphs. An L(2,1)-labeling of a graph G is an assignment of labels from {0,1,...,/spl lambda/} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart and the /spl lambda/-number /spl lambda/(G) of G is the minimum value /spl lambda/ such that G admits an L(2,1)-labeling. The /spl Delta//sup 2/-conjecture asserts that for any graph G its /spl lambda/-number is at most the square of its largest degree. In this paper it is shown that the conjecture holds for graphs that are direct or strong products of nontrivial graphs. Explicit labelings of such graphs are also constructed.

[1]  Gerard J. Chang,et al.  The L(2, 1)-labeling problem on ditrees , 2003, Ars Comb..

[2]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[3]  Richard J. Nowakowski,et al.  The strong isometric dimension of finite reflexive graphs , 2000, Discuss. Math. Graph Theory.

[4]  Aleksander Vesel,et al.  L(2, 1)-labeling of direct product of paths and cycles , 2005, Discret. Appl. Math..

[5]  Zhendong Shao,et al.  The L(2,1)-labeling and operations of graphs , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  John P. Georges,et al.  On generalized Petersen graphs labeled with a condition at distance two , 2002, Discret. Math..

[7]  LI Shuang-cheng,et al.  The L(d■,1 ■)-labeling of graphs , 2003 .

[8]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[9]  G. Chang,et al.  Labeling graphs with a condition at distance two , 2005 .

[10]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[11]  Pranava K. Jha,et al.  Isomorphic components of Kronecker product of bipartite graphs , 1997, Discuss. Math. Graph Theory.

[12]  Pranava K. Jha.  Smallest independent dominating sets in Kronecker products of cycles , 2001, Discret. Appl. Math..

[13]  Peter C. Fishburn,et al.  No-hole L(2, 1)-colorings , 2003, Discret. Appl. Math..

[14]  Danilo Korze,et al.  L(2, 1)-labeling of strong products of cycles , 2005, Inf. Process. Lett..

[15]  Daniel Král,et al.  A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..

[16]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..

[17]  Jing-Ho Yan,et al.  On L(2, 1)-labelings of Cartesian products of paths and cycles , 2004, Discret. Math..

[18]  Tiziana Calamoneri,et al.  The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography , 2006, Comput. J..

[19]  Kenneth S. Stevens,et al.  The Architecture of FAIM-1 , 1987, Computer.

[20]  K. Wendy Tang,et al.  Diagonal and Toroidal Mesh Networks , 1994, IEEE Trans. Computers.

[21]  P. K. Jha.  Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] , 2001 .

[22]  Aleksander Vesel,et al.  Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers , 2003, Discret. Appl. Math..

[23]  Rami G. Melhem,et al.  Computational Arrays with Flexible Redundancy , 1994, IEEE Trans. Computers.

[24]  Tom Bohman.  A limit theorem for the Shannon capacities of odd cycles. II , 2003 .