Graph coloring is one of the chief topics in the graph research, the solution of the chromatic number of the graph is an NP-hard problem. Let G(V, E) be a simple graph, k is a positive integer. f is a mapping from V(G)∪ E(G) to {1, 2, …, k} such that ∀uv∈E(G), then f(u)≠f(uv), f(v)≠f(uv), C(u)≠C(v), f can be called the vertex-edge-adjacent vertex distinguishing total coloring of G (adjacent vertex distinguishing VE-total coloring of G), χ_at^ve(G)=min{k|k－VE－AVDTC} would be called the vertex-edge-adjacent vertex distinguishing total chromatic number of G (adjacent vertex distinguishing VE-total chromatic number of G), where vertex-edge-adjacent vertex distinguishing total coloring of G C(u)={f(u)}∪{f(uv)|uv∈E(G)}. In this paper, two kinds of crown graphs C_m·S_n and C_m·P_n are designed, the vertex-edge-adjacent vertex distinguishing total coloring of C_m·S_n and C_m·P_n are studied. According to the properties of two kinds of crown graphs C_m·S_n and C_m·P_n, by using colors one by one and in recursion, the vertex-edge-adjacent vertex distinguishing total chromatic numbers of two kinds of crown graphs C_m·S_n and C_m·P_n are obtained.