Neighbor sum distinguishing list total coloring of subcubic graphs

Let be a simple graph and denote the set of edges incident to a vertex v by E(v). The neighbor sum distinguishing (NSD) total choice number of G, denoted by , is the smallest integer k such that, after assigning each a set L(z) of k real numbers, G has a total coloring satisfying for each and for each . In this paper, we propose some reducible configurations of NSD list total coloring for general graphs by applying the Combinatorial Nullstellensatz. As an application, we present that for every subcubic graph G.