两类图的邻点可区别全染色  

Adjacent Vertex Distinguishing Total Coloring of Two Class Graphs

作　　者：曹蓉 林育青[2] 童细心 CAO Rong;LIN Yuqing;TONG Xixin(Shantou Preschool Education College in Guangdong,Shantou 515041,Guangdong,China;Department of Natural Sciences,Shantou Polytechnic,Shantou 515041,Guangdong,China)

机构地区：[1]广东汕头幼儿师范高等教育专科学校,广东汕头515041 [2]汕头职业技术学院自然科学系,广东汕头515041

出　　处：《汕头大学学报（自然科学版）》2022年第2期13-25,33,共14页Journal of Shantou University：Natural Science Edition

基　　金：汕头职业技术学院2018年院级科研重点课题(SZK2018Z01)。

摘　　要：图G的邻点可区别全染色是G的一个正常全染色,使得每一对相邻顶点有不同的颜色集合.G的邻点可区别全色数χ_(at)(G)是使得G有一个k-邻点可区别全染色的最小颜色数k.研究了轮环图kC_(n)和图k×C_(n)的邻点可区别全染色,得到了两类图的邻点可区别全色数.Adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors.The minimum number of colors needed for an adjacent vertex distinguishing total coloring of G is denoted by χ_(at)(G).Adjacent vertex distinguishing total coloring of graph k C_(n) and graph k×C_(n) has been studied,and the adjacent vertex distinguishing total chromatic number of graph kC_(n) and graph k×C_(n) is obtained.

关 键 词：邻点可区别全染色 邻点可区别全色数 轮环图kC_(n) 柱图k×C_(n) 

分 类 号：O157.5[理学—数学]