摘要
为了进一步研究图的邻点全和可区别全染色问题,该文根据倍图的结构性,通过穷染法和染色算法,得到了路、圈、星、扇、轮、完全二部图以及树的倍图的邻点全和可区别全色数的精确值.
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.
作者
程银万
杨超
姚兵
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)
出处
《华中师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2023年第5期682-687,共6页
Journal of Central China Normal University：Natural Sciences
基金
国家自然科学基金项目(61672001,61662066,62072296).
关键词
全染色
邻点全和可区别全色数
倍图
total coloring
neighbor full sum distinguishing total chromatic number
double graphs
