2010•Journal of Suzhou University of Science and TechnologyRequires access
The vertex distinguishing equitable edge chromatic numbers of Mycielski graph of several kinds of graphs
Cui Jun-feng
Open publisher page 0 citations
Abstract
A proper edge coloring f of a simple graph G is called vertex distinguishing edge coloring.If u,v∈ V(G),C(u)≠C(v),C(u)={f(uv) uv∈E(G)}.If |Ei|-|Ej| ≤1(i,j=1,2,…,k),e∈Ei,f(e)=i(i=1,2,…,k),and thus f is called vertex distinguishing equitable edge coloring of graph G.In this paper,we have discussed the vertex distinguishing equitable edge coloring of Mycielski graph of several kinds of graphs.