THE GENERAL NEIGHBOR-DISTINGUISHING TOTAL COLORING OF GRAPHS
关于图的一般邻点可区别全染色

In this paper, a new notion is proposed that is the general neighbor-istinguishing total coloring. The general neighbor-distinguishing total coloring chromatic index of the paths $P_n$, cycles $C_n$, stars $S_n$, fans $F_n$wheel graphs $W_n$, bipartite graphs $G\langle V_1,V_2,E\rangle$, trees $T_n$ and complete graphs $K_n$ are given.