Neighbor Full Sum Distinguishing Total Coloring of Square Graphs

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.