Abstract:

We studied the vertex distinguishing edge coloring of K_n(n≥20, n≡0(mod2)) graph with four independent edges deleted, and obtained the vertexdistinguishing edge chromatic number of K_n-{v₁v₂,v₃v₄,v₅v₆,v₇v₈}(n≥20, n≡0(mod2)), where K_n-{v₁v₂,v₃v₄,v₅v₆,v₇v₈} is denoted by the complete graph with order n deleted edges {v₁v₂,v₃v₄,v₅v₆,v₇v₈} of K_n.

Key words: edge coloring, vertexdistinguishing edge coloring, vertexdistinguishing edge chromatic number