摘要
利用组合零点定理和权转移法,研究了最大度Δ(G)≥8且最大平均度mad(G)<14/3的图G的邻和可区别列表全染色,确定了该类图的邻和可区别全可选择数不超过Δ(G)+3.
This paper explores the neighbor sum distinguishing list total coloring of graphs with maximum degree Δ(G)≥8 and maximum average degree mad(G)<14/3.By applications of the Combinatorial Nullstellensatz and discharge method,moreover,it is shown that the neighbor sum distinguishing total choice number of the graphs does not exceed Δ(G)+3.
作者
张东翰
ZHANG Donghan(School of Mathematics and Statistics,Northwestern Polytechnical University,Xi’an 710129,China;School of Mathematics and Computer Application,Shangluo University,Shangluo Shaanxi 726000,China)
出处
《华东师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2022年第1期10-16,共7页
Journal of East China Normal University(Natural Science)
基金
陕西省科协高校青年人才托举计划(20180508)。
关键词
组合零点定理
邻和可区别全可选择数
权转移法
Combinatorial Nullstellensatz
neighbor sum distinguishing total choice number
discharge method
