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

Adjacent Vertex Distinguishing Total Coloring of a Class Graph

作　　者：林育青[1] LIN Yu-qing(Department of Natural Sciences of Shantou Polytechnics,Shantou 515041,China)

机构地区：[1]广东省汕头职业技术学院,广东汕头515041

出　　处：《数学的实践与认识》2020年第20期263-271,共9页Mathematics in Practice and Theory

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

摘　　要：图G的邻点可区别全染色是G的一个正常全染色,使得每一对相邻顶点有不同的颜色集合,G的邻点可区别全色数χat(G)是使得G有一个k-邻点可区别全染色的最小颜色数k.证明了:对任意非负整数m、n,图Pnm满足:χat(Pnm)≤Δ(Pnm)+2.The adjacent vertex-distinguishing total coloring of Graph G,as a proper total coloring,will generalize distinct set of colors of every pair of adjacent vertex.The adjacent vertex-distinguishing total chromatic numberχat(G)of Graph G generalizes the minimum number of colors k required for the adjacent vertex-distinguishing total coloring.In this paper,it is proved that for any nonnegative integer m,n,Graph Pnm hasχat(Pnm)≤Δ(Pnm)+2.

关 键 词：全染色 邻点可区别全染色 P_n^m 

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