Neighbor full sum distinguishing total coloring of some double graphs
CHENG Yinwan1， YANG Chao1， YAO Bing2
(1.School of Mathematics， Physics and Statistics， Center of Intelligent Computing and Applied Statistics， Shanghai University of Engineering Science， Shanghai 201620， China；2.College of Mathematics and Statistics， Northwest Normal University， Lanzhou 730070， China)
Abstract：To further study the problem of neighbor full sum distinguishing total coloring， according to the structural characteristics of double graphs， the neighbor full sum distinguishing total chromatic exact numbers for double graphs of path， cycle， star， fan， wheel， complete bipartite graph and tree are determined by exhaustive coloring method and coloring algorithm in this paper.
2023, Vol. 57 
