The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs

被引：0

作者：

Wang, Zhiwen ^{[1
]}

Zhu, Enqiang ^{[2
]}

机构：

[1] Ningxia Univ, Sch Math & Comp Sci, Yinchuan 750021, Peoples R China

[2] Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou 730070, Peoples R China

来源：

2010 4TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING (ICBBE 2010) | 2010年

关键词：

Adjacent vertex-distinguishing total coloring; Adjacent vertex-distinguishing total chromatic number; complete graph; COLORINGS;

D O I：

暂无

中图分类号：

R318 [生物医学工程];

学科分类号：

0831 ;

摘要：

Let G = (V, E) be a graph and f:(V U E) -> [k] be a proper total k-coloring of G.We say that f is an adjacent vertex distinguishing total coloring if for any two adjacent vertices,the set of colors appearing on the vertex and incident edges are different. We call the smallest k for which such a coloring of G exists the adjacent vertex distinguishing total chromatic number,and denote it by x(at)(G). In this paper,we show that Xat (K-19- E(C-4)) = 20 and xat (K-21-E(C-4)) - 22.

引用

页数：3

共 50 条

[1] The adjacent vertex distinguishing total chromatic number of graphs
Wang, Zhiwen
Zhu, Enqiang
[J]. 2010 4th International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2010, 2010,
[2] A note on the adjacent vertex distinguishing total chromatic number of graphs
Huang, Danjun
Wang, Weifan
Yan, Chengchao
[J]. DISCRETE MATHEMATICS, 2012, 312 (24) : 3544 - 3546
[3] On the Adjacent Vertex Strong Distinguishing Total chromatic number of Some Graphs
Yan, Qiantai.
Li, Wuzhuang.
[J]. 2013 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA), 2013, : 391 - 394
[4] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
[J]. Hu, Xiaolan (xlhu@mail.ccnu.edu.cn), 2017, Elsevier B.V., Netherlands (233)
[5] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
Hu, Xiaolan
Zhang, Yunqing
Miao, Zhengke
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 29 - 32
[6] The adjacent vertex distinguishing total chromatic number
Coker, Tom
Johannson, Karen
[J]. DISCRETE MATHEMATICS, 2012, 312 (17) : 2741 - 2750
[7] On the adjacent vertex distinguishing edge chromatic number of graphs
Wang, Zhiwen
[J]. ARS COMBINATORIA, 2016, 124 : 379 - 388
[8] On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs
Zhu, Enqiang
Jiang, Fei
Li, Zepeng
Shao, Zehui
Xu, Jin
[J]. 2016 IEEE FIRST INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC 2016), 2016, : 230 - 234
[9] On Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs
Zhu, Enqiang
Liu, Chanjuan
Xu, Jin
[J]. TAIWANESE JOURNAL OF MATHEMATICS, 2017, 21 (02): : 253 - 266
[10] A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Some Cubic Graphs
Chen, Qin
[J]. ARS COMBINATORIA, 2016, 124 : 319 - 327

← 1 2 3 4 5 →