图K_3~cVK_t的点可区别正常边染色

图G的正常边染色称为是点可区别的,如果对G的任意两顶点的关联边的颜色构成的集合不同.对图G进行点可区别正常边染色所需要的最少颜色数称为图G的点可区别正常边色数,记为x_s'(G).给出了3阶空图与t阶完全图的联图的点可区别正常边色数.

On the vertex-distinguishing proper edge-coloring of K_3~c∨K_t

A k-proper edge coloring of a simple graph G is called vertex-distinguishing if for arbitrary two different vertices u and v,the set of colors assigned to the edges incident to u differs from the set of colors assigned to the edges incident to v.The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is called vertex-distinguishing proper edge chromatic number of G and denoted by x_s'(G).The vertex-distinguishing proper edge chromatic numbers of K_3~c∨K_t are obtained in this paper.