K1,1,p,K1,2,p的点可区别的IE-全染色及一般全染色

吉林大学学报(理学版)

K_1,1,p,K_1,2,p的点可区别的IE-全染色及一般全染色

寇艳芳¹, 陈祥恩^1, 王治文²

1. 西北师范大学数学与统计学院, 兰州 730070; 2. 宁夏大学数学计算机科学学院, 银川 750021

收稿日期:2017-01-11 出版日期:2018-03-26 发布日期:2018-03-27
通讯作者: 寇艳芳 E-mail:1637191507@qq.com

VertexDistinguishing IETotal Coloring andGeneralTotal Coloring of K_1,1,p,K_1,2,p

KOU Yanfang^1, CHEN Xiang’en^1, WANG Zhiwen²

1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;2. School of Mathematics and Computer Sciences, Ningxia University, Yinchuan 750021, China

Received:2017-01-11 Online:2018-03-26 Published:2018-03-27
Contact: KOU Yanfang E-mail:1637191507@qq.com

摘要/Abstract

摘要： 以完全三部图K_1,1,p,K_1,2,p为例, 利用色集事先分配法、构造染色法、反证法, 讨论完全三部图K_1,1,p,K_1,2,p的点可区别IE-全染色及点可区别一般全染色问题, 确定了K_1,1,p,K_1,2,p的点可区别IE-全色数及点可区别一般全色数.

关键词: 点可区别一般全色数, 点可区别IE全色数, 完全三部图

Abstract: Taking the complete tripartite graphs K_1,1,p,K_1,2,p as examples, we discussed vertexdistinguishing IEtotal coloring and vertexdistinguishing general total coloring problem of the complete tripartite graphs K_1,1,p,K_1,2,p by using the methods of the color sets prior distribution, constru
cting the dyeing and proofing by contradiction. We determined the vertexdistinguishing IEtotal coloring chromatic number and vertexdistinguishing general total chromatic number of K_1,1,p,K_1,2,p.

Key words: complete tripartite graph, vertexdistinguishing general total chromatic number, vertexdistinguishing IEtotal chromatic number

中图分类号:

O157.5

寇艳芳, 陈祥恩, 王治文. K_1,1,p,K_1,2,p的点可区别的IE-全染色及一般全染色[J]. 吉林大学学报(理学版), 2018, 56(2): 299-305.

KOU Yanfang, CHEN Xiang’en, WANG Zhiwen. VertexDistinguishing IETotal Coloring andGeneralTotal Coloring of K_1,1,p,K_1,2,p[J]. Journal of Jilin University Science Edition, 2018, 56(2): 299-305.

[1]	杨佳睿, 陈祥恩. K_3,5,p的点可区别的一般全染色[J]. 吉林大学学报(理学版), 2020, 58(4): 832-840.
[2]	唐保祥, 任韩. 三类特殊图的优美性[J]. 吉林大学学报(理学版), 2016, 54(06): 1337-1340.