给出了最小度至少是2的图G的k重Mycielski图M^k(G)(其中k为正整数)的点可区别全色数的上界.
Let k be a positive integer and the upper bounds of the vertex-distinguishing total coloring number of k multi Mycielski's graphs M^k(G) of a graph G with minimum degree of at least 2 were given.