Abstract: In the report, let G(V，E) be a simple connect graph with order at least 2 and k be a positive integer. Mapping f from V∪E to 1, 2, …, k was named a general adjacent vertex distinguishing total coloring of G, or k-GAVDTC， if ∀uv∈E(G), C(u)≠C(v), in which C(u)=f(u)∪f(uv)|uv∈E(G). The number χ_gat(G)=mink|k- GAVDTC of G is named the general adjacent vertex distinguishing total chromatic number of G. The combination of structural method, adjustment method and probability method, were used to discuss the general adjacent vertex distinguishing total coloring of Mycielski graphs of some particular graphs such as path, cycle, fan, star, wheel and complete bipartite graph. And the general adjacent vertex distinguishing total chromatic number of them was confirmed.