Vertex-distinguishing Edge Coloring of Graph K_(2n)\E(K_(2,m))(n≥9,m≥3)
Qiang Hui-ying · Shuxue de shijian yu renshi · 2012
Let G(V,E) be a simple graph,k is a positive integer.f is a mapping from E(G) to {1,2,…,k} such that:(?)uv,uw∈E{G),v≠w,f(uv)≠f(uw);(?)u,v∈V(G),C(u)≠C(v). We say that f is a k-vertex distinguishing edge coloring of G,the minimal number fc is called the vertex distinguishing edge chromatic number.In this paper,we discussed the vertex distinguishing edge chromatic number of K_(2n)\E{K_(2,m)){n≥9,m≥3).