【摘要】 考虑图的邻和可区别全染色问题及其相关的1-2猜想.首先，利用独立消圈集法得到剖分图S(G)和三角扩展图R(G)的邻和可区别全色数；其次，当G为任意简单连通图且T为给定的特殊图时，证明边替换图G[T]满足1-2猜想.更多还原

【Abstract】 We considered the problem of neighbor sum distinguishing total colorings of gragh and its related 1-2 conjecture. Firstly, by using the independent decycling set method, we obtained the neighbor sum distinguishing total chromatic numbers of the subdivision graph S(G) and the triangular extension graph R(G). Secondly, when G was an arbitrary simple connected graph and T was a given special graph, we proved that the edge-replaced graph G[T] satisfied the 1-2 conjecture.更多还原