摘要
考虑m个长为7的圈点不交的并mC7的点可区别全染色问题.通过构造以色集合为元素的矩阵,利用色集合事先分配法及递归法确定染色,得出了mC_7的点可区别全色数的确切值.结果表明VDTC猜想对图mC_7成立.
We considered the problem of the vertex-distinguishing total colorings of the disjoint union mC7 of m cycles of length 7. By constructing a matrix which was composed of color sets as elements, the vertex distinguishing total coloring of raG7 was determined by using the methods of distributing color sets in advance and induction. We obtained the exact value of vertex-distinguishing total chromatic number of rnCT. The results show that the VDTC conjecture is valid for taCT.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2017年第3期531-536,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:61163037
61163054
11261046)
宁夏回族自治区百人计划资助项目
关键词
圈
图的并
点可区别全染色
点可区别全色数
cycle
union of graphs
vertex-distinguishing total coloring
vertex-distinguishing totalchromatic number