Distinguishing Equitable Edge Coloring of the Vertex C_mοS_n

The paper focused on the distinguishing equitable edge coloring of one kind of crown graph. Combinatorial method was presented in different cases, and finally the conjecture of bound of the coloring number of the vertex distinguishing equitable edge of crown graph μ (G) ≤ χ ′vde(G) ≤ μ(G) + 1 was proved. It concludes that method for solving the coloring of this kind of crown graph is effective.