若干圈的广义冠图的(2,1)-全标号

华东师范大学学报(自然科学版) ›› 2013, Vol. 2013 ›› Issue (2): 124-130.

若干圈的广义冠图的(2,1)-全标号

刘秀丽

菏泽学院~~数学系, 山东~~菏泽 274015

收稿日期:2012-04-01 修回日期:2012-07-01 出版日期:2013-03-25 发布日期:2013-03-20

(2,1)-total labelling of some general\\[1mm] crown graphs of circle

LIU Xiu-li

Department of Mathematics, Heze University, Heze Shandong 274015, China

Received:2012-04-01 Revised:2012-07-01 Online:2013-03-25 Published:2013-03-20

摘要/Abstract

摘要： 研究了与频率分配有关的一种染色问题: (2,1)-全标号,
它是对图的全染色的一种推广, 根据圈的广义冠图的构造特征, 利用穷染法,
给出了一种标号方法,
得到了几类圈的广义冠图的(2,1)-全标号数.

关键词: (2,1)-全标号, (2,1)-全标号数, 全染色, 广义冠图

Abstract: The coloring problem of (2,1)-total labelling of some
graphs was related to frequency assignment problems. By using the
eternal coloring method, a new labelling method according to the
feature of the general crown graphs of circle was given and the
(2,1)-total numbers of these graphs was obtained. And the
(2,1)-total labelling of graphs extends the total coloring of
graphs.

Key words: (2,1)-total labelling, (2,1)-total number, total coloring, general crown graph

中图分类号:

0157.5

刘秀丽. 若干圈的广义冠图的(2,1)-全标号[J]. 华东师范大学学报(自然科学版), 2013, 2013(2): 124-130.

LIU Xiu-li. (2,1)-total labelling of some general\\[1mm] crown graphs of circle[J]. Journal of East China Normal University(Natural Sc, 2013, 2013(2): 124-130.

参考文献

{1}

GRIGGS J R, YEH R K. Labelling graphs with a condition at distance

two[J]. SIAM J Discrete Math, 1992, 5(4): 586-595.
{2}

GEORGES J P, MAURO D W, STEIN M I. Labelling products of complete

graphs with a condition at distance two[J]. SIAM J Discrete Math,

2000, 14: 28-35.
{3}

GEORGES J P, MAURO D W, WHITTLESEY M A. Relating path coring to

vertex labelling graphs with a condition at distance two[J].

Discrete Math, 1994, 135: 103-111.
{4}

MOLLOY M, SALAVATIPOUR M R. A bound on the chromatic number of the

square of a planar graph[J]. J Combin Theory Ser B, 2005, 94:

189-213.
{5}

WANG W. The $L(2,1)$-labelling of trees[J]. Discrete Appl Math,

2006, 154: 598-603.
{6}

WHITTLESEY M A, GEORGES J P, MAURO D W. On the $\lambda$-number of

$Q_{n}$ and related graphs[J]. SIAM J Discrete Math, 1995, 8(4):

449-506.
{7}

HAVET F, YU M L. $(p,1)$-Total labelling of graphs[J]. Discrete

Math, 2008, 308(4): 496-513.
{8}

HULGAN J. Concise proofs for adjacent-vertex distinguishing total

colorings[J]. Discrete Math, 2009, 309(8): 2548-2550.
{9}

ZHANG Z F, CHEN X E, LI J W, et al. On the adjacent vertex strongly

distinguishing total coloring of graphs[J]. Science in China Ser

A-Math, 2008, 51(3): 427-436.
{10}

WANG W. Total chromatic number of planar graphs with maximum degree

ten[J]. J Graph Theory, 2007, 54: 91-102.
{11}

CHEN X E, ZHANG Z F. Adjacent-vertex-distinguishing total chromatic

number of $P_{m}\times K_{n}$[J]. Journal of Mathematical Research

and Exposition, 2006, 26(3): 489-494.
{12}

田京京. 若干圈的广义冠图的2-强边染色[J]. 数学杂志, 2011, 31(5):

938-944.\\

TIAN J J. The 2-strong edge-coloring of some general crown graphs of

circle[J]. Journal of Math, 2011, 31(5): 938-944 (in chinese).
{13}

CHEN D, WANG W F. (2,1)-Total labelling of graphs[J]. Discrete

Applied Math, 2007, 155: 2585-2593.

[1]	陈祥恩, 曹静. 圈与路的点被多重集可区别的E-全染色[J]. 华东师范大学学报（自然科学版）, 2024, 2024(2): 14-22.
[2]	闫瑞敏, 陈祥恩. ${K_{5,\;5,\;p}} $ 的点可区别的IE-全染色 $(p \geqslant 2\;028) $ [J]. 华东师范大学学报（自然科学版）, 2022, 2022(2): 16-23.
[3]	陈祥恩, 杨伟光. 完全二部图K_{9, n} (93 ≤ n ≤ 216)的点可区别E-全染色[J]. 华东师范大学学报（自然科学版）, 2020, 2020(6): 24-29.
[4]	许洋. 非负特征图的列表不完全染色的研究(英)[J]. 华东师范大学学报(自然科学版), 2016, 2016(2): 51-55.
[5]	黄小佳, 陈祥恩, 王治文. 当35 ≤ d ≤ 55时圈的d-强全染色[J]. 华东师范大学学报(自然科学版), 2015, 2015(6): 30-35.
[6]	杨超, 姚兵, 王宏宇. 广义~Petersen~图在四种可区分条件下的全染色[J]. 华东师范大学学报(自然科学版), 2013, 2013(6): 57-67.