一类稀疏图的邻和可区别全染色
Neighbor Sum Distinguishing Total Coloring of A Class of Sparse Graphs
樊玉花 1张东翰1
作者信息
- 1. 商洛学院数学与计算机应用学院,726000,陕西,商洛
- 折叠
摘要
利用组合零点定理和权转移法,研究了一类稀疏图的邻和可区别全染色,证明了这类图的邻和可区别全色数不超过Δ + 3,得到了邻和可区别全色数猜想对这类稀疏图是成立的.
Abstract
In this paper,we study neighbor sum distinguishing total coloring of a class of sparse graphs and prove that the neighbor sum distinguishing total chrmatic number of this type of graphs doesn't exceed Δ+3 by applying the Combinatorial Nullstellensatz and discharge method.We obtain that the conjecture of neighbor sum distinguishing total chromatic number holds for these sparse graphs.
关键词
邻和可区别全染色/组合零点定理/权转移法Key words
neighbor sum distinguishing total coloring/Combinatorial Nullstellensatz/discharge method引用本文复制引用
基金项目
商洛学院大学生创新创业训练计划(S202111396050)
商洛学院博士科研启动基金(22SKY112)
出版年
2024
国家科技期刊平台
NSTL
维普
万方数据