P_2×P_n(n≡0(mod 4))的邻点可区别Ⅰ-均匀全染色  

Incidence-adjacent vertex distinguishing equitable total coloring of P_2×P_n (n≡0(mod 4))

作　　者：王继顺[1] WANG Ji-shun(School of Mathematics and Information Engineering,Lianyungang Normal College,Lianyungang 222006,China)

机构地区：[1]连云港师范高等专科学校数学与信息工程学院,江苏连云港222006

出　　处：《高师理科学刊》2019年第1期7-9,共3页Journal of Science of Teachers＇College and University

基　　金：江苏省高等教育科学研究"十三五"规划课题(16YB091);连云港师范高等专科学校校科研课题(LYGSZ17051)

摘　　要：讨论笛卡儿积图P_2×P^n当n≡0(mod 4)时邻点可区别Ⅰ-均匀全染色问题,根据该类图的结构性质,通过构造法给出它们的邻点可区别Ⅰ-均匀全染色方法,从而有效地确定了其邻点可区别Ⅰ-均匀全色数为4.The incidence-adjacent vertex distinguishing equitable total coloring of Cartesian product graphs P2 ×Pn (n≡0(mod 4)) are discussed.By means of the construction method,the incidence-adjacent vertex distinguishing equitable total coloring of P2 ×Pn are obtained, which determined effectively that the incidence-adjacent vertex distinguishing equitable total chromatic numbers of P2 ×Pn are 4 according to the structural properties of this kind of graphs.

关 键 词：笛卡儿积图 邻点可区别Ⅰ-均匀全染色 全色数 

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