路与星联图的点可区别边染色

On Vertex-distinguishing Edge Coloring of P_m∨K_(1,n)

对图G的正常边染色,若满足不同点的点所关联边色集合不同,则称此染色法为点可区别的边染色法,其所用最少染色数称为该图的点可区域边色数。本文得到了路与星的联图的点可区别边色数。

The normal edge coloring for a graph G is called vertex-distinguishing edge coloring method if every two vertices are incident to an edge with the vertex and the minimum number of colors required is called the number of a vertex-distinguishing edge-coloring of the graph G denoted by X＇vd（G）, In this paper, we have given the vertex-distinguishing edge chromatic number of Pm∨K1,n.