摘要
以完全三部图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-全色数及点可区别一般全色数.
Taking the complete tripartite graphs K_(1,1,p),K_(1,2,p)as examples,we discussed vertexdistinguishing 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,constructing 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).
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2018年第2期299-305,共7页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:11761064
61163037
11261046)
宁夏回族自治区百人计划项目
关键词
完全三部图
点可区别IE-全色数
点可区别一般全色数
complete tripartite graph
vertex-distinguishing IE-total chromatic number
vertex-distinguishing general total chromatic number
