路的Smarandachely点可区别全染色

Smarandachely Vertex Distinguishing Total Coloring of Path

利用对角线排序法给出了计算机算法,并证明了路图满足Smarandachely点可区别全染色猜想:设G是简单图,则χst(G)≤tμ(G)+1,其中tμ为组合全度.

In this paper,by using the diagonal sequence a computer algorithm is given,and it is proved that path satisfies the conjecture of Smarandachely total coloring of graph： For a simple graph G,one has χst（G）≤μt（G）＋1,where μt is combinatorial total degree.