2008•Journal of Lanzhou Jiaotong UniversityRequires access
On Vertex Distinguishing Equitable Edge Coloring of Double Graph of Fan and Wheel
Wang Wu-min
Open publisher page 0 citations
Abstract
A proper edge coloring f of a simple graph G is called vertex distinguishing edge coloring,if any,u,v∈V(G),C(u)≠C(v),(whereC(u)={f(uv)|uv∈E(G)}).If |Ei|-|Ej|≤1(i,j=1,2,…,k)is satisfied,(where any e∈Ei,f(e)=i(i=1,2,…,k)),then f is called vertex distinguishing equitable edge coloring.In this paper,vertex distinguishing equitable edge coloring of double graph of fan and wheel is discussed.