论文信息 - L(2, 1)-labeling of a circular graph

L(2, 1)-labeling of a circular graph

In this paper the A-number of the circular graph C(km, m) 1s shown at most 9 where m 2: 3 and k 2: 2, and the .\-number of the circular graph C ( km + s, m) is shown at most 15 where m 2: 3, k 2: 2 and 1 :"::: s :"::: m1. In particular, the .\-numbers of C(2m, m) and C(n, 2) are determined, which are at most 8. All our results indicates that the Griggs and Yeh's conjecture holds for circular graphs. The conjecture says that for any graph G with maximum degree t. 2: 2, .\(G):"::: t-2 . Also, we determine A-numbers of C(n,3), C(n,4) and C(n, 5) if n = O(mod 7).

Han Ren | Dengju Ma | Damei Lu

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

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

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

[4] Roger K. Yeh. A survey on labeling graphs with a condition at distance two , 2006, Discret. Math..

[5] 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..

[6] Sarah Spence Adams,et al. The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs , 2007, Discret. Appl. Math..

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

[8] Denise Sakai Troxell,et al. L(2, 1)-labelings of Cartesian products of two cycles , 2006, Discret. Appl. Math..

[9] Pranava K. Jha,et al. On L(2, 1)-labeling of the Cartesian product of a cycle and a path , 2000, Ars Comb..

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