若干倍图的2-距离和可区别全染色  

2-Distance sum distinguishing total coloring of some double graphs

作　　者：王同昕 杨超 殷志祥 姚兵 WANG Tong-xin;YANG Chao;YIN Zhi-xiang;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,Gansu,China)

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

出　　处：《西北师范大学学报（自然科学版）》2023年第5期47-52,共6页Journal of Northwest Normal University(Natural Science)

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

摘　　要：为了研究图的2-距离和可区别全染色问题,根据倍图的结构特点,通过组合分析法和构造染色函数法,得到了路、圈、星、扇、轮、完全二部图的倍图的2-距离和可区别全色数.To study the problem of 2-distance sum distinguishing total coloring of graphs,according to the structural characteristics of double graphs,by taking advantage of combinatorial analysis and constructing coloring functions,the 2-distance sum distinguishing total chromatic numbers for double graphs of paths,cycles,stars,fans,wheels and complete bipartite graphs are obtained,respectively.

关 键 词：全染色 2-距离和可区别全染色 倍图 全色数 最大度 

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