On the General Neighbour-distinguishing Edge Coloring of P_n~2×S_m and P_n~2×F_m
Liu Li-qun · Journal of Qufu Normal University · 2010
Let G be a simple graph,The gnd-coloring is general neighbour-distinguishing edge coloring,the neighbour-distinguishing edge coloring is that if for any adjacent vertices u,v∈V(G) we have C(u)≠C(v).C(u) is the colours set of the edges which are incident with the vertex u.In this paper,we obtained the general neighbour-distinguishing edgel chromatic number of P_n~2×S_m and P_n~2×F_m