定义新图 P^2n,并在n≥3时,确定 P^2n的Mycielski图的邻强边色数和邻点可区别全色数,构造一个M( P^2n)的邻点可区别全染色法.
A new graph of P^2n was defined,the adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic number,and construct the coloring method of adjacent vertex distinguishing total coloring of the graph of Mycielski of graph P^2n also be confirmed when n ≥ 3.