若干倍图的邻点全和可区别全染色  

Neighbor full sum distinguishing total coloring of some double graphs

作　　者：程银万 杨超 姚兵 CHENG Yinwan;YANG Chao;YAO Bing(School of Mathematics,Physics and Statistics,Center of Intelligent Computing and Applied Statistics,Shanghai University of Engineering Science,Shanghai 201620,China;College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]上海工程技术大学数理与统计学院,智能计算与应用统计研究中心,上海201620 [2]西北师范大学数学与统计学院,兰州730070

出　　处：《华中师范大学学报（自然科学版）》2023年第5期682-687,共6页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金项目(61672001,61662066,62072296).

摘　　要：为了进一步研究图的邻点全和可区别全染色问题,该文根据倍图的结构性,通过穷染法和染色算法,得到了路、圈、星、扇、轮、完全二部图以及树的倍图的邻点全和可区别全色数的精确值.To further study the problem of neighbor full sum distinguishing total coloring,according to the structural characteristics of double graphs,the neighbor full sum distinguishing total chromatic exact numbers for double graphs of path,cycle,star,fan,wheel,complete bipartite graph and tree are determined by exhaustive coloring method and coloring algorithm in this paper.

关 键 词：全染色 邻点全和可区别全色数 倍图 

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