三正则构造图的邻点全和可区别全染色  

Neighbor Full Sum Distinguishing Total Coloring of 3-Regular Construction Graphs

作　　者：杨超 程银万 姚兵 YANG Chao;CHENG Yinwan;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

出　　处：《吉林大学学报（理学版）》2024年第6期1301-1307,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:61672001,61662066,62072296).

摘　　要：首先,根据Snark图的结构特点,构造基于双星和十字交叉形的两类三正则图;其次,利用穷染法和组合分析法研究四类三正则构造图的邻点全和可区别全染色问题,得到了它们的邻点全和可区别全色数均为2.Firstly,according to the structural characteristics of Snark graphs,we constructed two classes of 3-regular graphs based on Double Star and Cross.Secondly,we studied the problem of neighbor full sum distinguishing total coloring of four classes of 3-regular graphs by exhaustive coloring method and combinatorial analysis,and obtained that the neighbor full sum distinguishing total chromatic numbers for these graphs are all 2.

关 键 词：非正常全染色 邻点全和可区别全染色 邻点全和可区别全色数 三正则图 

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