图的点可区别星边色数的一个上界(英文)

An upper bound for the vertex-distinguishing star edge chromatic number of graphs

图G的点可区别星边边色数，记为X＇vds（G），是图G的点可区别星边染色所用色的最小数目．得到了一些特殊图的星边染色，并证明了若图G是一个最小度不小于5，且顶点数不超过△7的图时，X＇vds（G）≤14△2其中△是图G的最大度．

The vertex-distinguishing star edge chromatic number of G, denoted by X＇vds（G）, is the minimura number of colors in a vertex-distinguishing star edge coloring of G. The vertex-distinguishing star edge colorings of some particular graphs were obtained. Fur- thermore, if G（V,E） is a graph with δ ≥ 5, and n ≤ △7, then X＇vds（G） ≤ 14△2, where n is the order of G, 5（G） is the minimum degree of G, and A（G） is the maximum degree of G.