王芹, 杨超, 常景智, 程银万, 姚兵. 平方图的邻点全和可区别全染色[J]. 华南师范大学学报(自然科学版), 2022, 54(1): 107-112. doi: 10.6054/j.jscnun.2022015
引用本文: 王芹, 杨超, 常景智, 程银万, 姚兵. 平方图的邻点全和可区别全染色[J]. 华南师范大学学报(自然科学版), 2022, 54(1): 107-112. doi: 10.6054/j.jscnun.2022015
WANG Qin, YANG Chao, CHANG Jingzhi, CHENG Yinwan, YAO Bing. Neighbor Full Sum Distinguishing Total Coloring of Square Graphs[J]. Journal of South China Normal University (Natural Science Edition), 2022, 54(1): 107-112. doi: 10.6054/j.jscnun.2022015
Citation: WANG Qin, YANG Chao, CHANG Jingzhi, CHENG Yinwan, YAO Bing. Neighbor Full Sum Distinguishing Total Coloring of Square Graphs[J]. Journal of South China Normal University (Natural Science Edition), 2022, 54(1): 107-112. doi: 10.6054/j.jscnun.2022015

平方图的邻点全和可区别全染色

Neighbor Full Sum Distinguishing Total Coloring of Square Graphs

  • 摘要: 进一步研究了平方图的邻点全和可区别非正常全染色问题: 利用平方图的结构构造了路、圈、毛毛虫、广义星以及最大度为3且不含2度点的树的平方图, 通过组合分析法得到上述5类平方图的邻点全和可区别非正常全色数。

     

    Abstract: To further study the problem of the neighbor full sum distinguishing non-proper total coloring of the square graphs, the structural of square graphs are used for constructing paths, cycles, caterpillars, generalized stars and trees with maximum degree 3 and having no vertex of degree 2. And the neighbor full sum distinguishing total chromatic improper number of the above five types of square graphs are determined with the combinatorial analysis.

     

/

返回文章
返回