On the vertex-distinguishing edge colorings of some product graphs
Tian Shuang-liang · Journal of Shandong University · 2006
It is proved that(1) the vertex-distinguishing edge chromatic number of the product of two complete graphs with (n(n≥2)) order is 2n,(2) if χ′_(vd)(G)=Δ(G) and n≥3,then χ′_(vd)(G×K_n)=n+Δ(G),and(3) if χ′_(vd)(G_i)=Δ(G_i),i=1,2,then χ′_(vd)(G_1×G_2)=Δ(G_1)+Δ(G_2).