摘要
利用色集事先分配法,构造染色法,反证法探讨了完全三部图K_(1,3,p)和K_(1,4,p)的点可区别IE-全染色和点可区别一般全染色问题,确定了K_(1,3,p)和K_(1,4,p)的点可区别IE-全色数和点可区别一般全色数。
The vertex-distinguishing IE-total coloring and vertex-distinguishing general total coloring of complete tripartite graphs K1,3,pand K1,4,p are discussed by distributing the color sets in advance,constructing the colorings and proving by contradiction. The vertex-distinguishing IE-total chromatic number and vertex-distinguishing general total chromatic number of K1,3,p and K1,4,p have been determined.
作者
寇艳芳
陈祥恩
王治文
KOU Yan-fang;CHEN Xiang-en;WANG Zhi-wen(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China;School of Mathematics and Statistics,Ningxia University,Yinchuan 750021,Ningxia,China)
出处
《山东大学学报(理学版)》
CAS
CSCD
北大核心
2018年第8期53-60,共8页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(11761064
61163037
11261046)
宁夏回族自治区百人计划资助项目
关键词
完全三部图
IE-全染色
点可区别IE-全染色
一般全染色
点可区别一般全染色
complete tripartite graphs
IE-total coloring
vertex-distinguishing IE-total coloring
general total coloring
vertex-distinguishing general total coloring