Journal of East China Normal University(Natural Science) ›› 2022, Vol. 2022 ›› Issue (1): 10-16.doi: 10.3969/j.issn.1000-5641.2022.01.002

• Mathematics • Previous Articles    

Neighbor sum distinguishing total choice number of graphs with bounded maximum average degree

Donghan ZHANG1,2()   

  1. 1. School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an 710129, China
    2. School of Mathematics and Computer Application, Shangluo University, Shangluo Shaanxi 726000, China
  • Received:2021-05-07 Online:2022-01-25 Published:2022-01-18

Abstract:

This paper explores the neighbor sum distinguishing list total coloring of graphs $G$ with maximum degree $\varDelta \left( G \right) \geqslant 8$ and maximum average degree ${\rm{mad}}\left( G \right) < \frac{{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 $\varDelta \left( G \right) + 3$ .

Key words: Combinatorial Nullstellensatz, neighbor sum distinguishing total choice number, discharge method

CLC Number: