摘要
利用色集合事先分配法及具体的染色给出了mC_(7)的最优点可区别Ⅰ-全染色以及最优点可区别Ⅵ-全染色,进而确定了图mC_(7)的点可区别Ⅰ-全色数及点可区别Ⅵ-全色数。结论表明VDITC猜想和VDVITC猜想对图mC_(7)成立。
By using the methods of constructing a matrix which was composed of color sets and empty set as the elements,distributing color sets in advance and coloring explicitly,to give the optimal vertex distinguishingⅠ-total colorings and the optimal vertex distinguishingⅥ-total colorings of mC_(7).Thus vertex distinguishingⅠ-total chromatic numbers and the vertex distinguishingⅥ-total chromatic numbers of mC_(7)are determined.The results show that the VDITC conjecture and VDVITC conjecture are valid for mC_(7).
作者
杨晗
陈祥恩
YANG Han;CHEN Xiang-en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2021年第11期76-82,92,共8页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(11761064)。
关键词
圈
不交并
点可区别Ⅰ-全染色
点可区别Ⅵ-全染色
点可区别Ⅰ-全色数
点可区别Ⅵ-全色数
cycle
disjoint union
vertex-distinguishingⅠ-total coloring
vertex-distinguishingⅥ-total coloring
vertex-distinguishingⅠ-total chromatic number
vertex-distinguishingⅥ-total chromatic number
