Journal of East China Normal University(Natural Sc ›› 2012, Vol. 2012 ›› Issue (5): 120-126.
• Article • Previous Articles Next Articles
LIU Xin-sheng, LU Wei-hua
Received:
Revised:
Online:
Published:
Abstract: The vertex-distinguishing star edge chromatic number of G, denoted by χ′vds(G), is the minimum number of colors in a vertex-distinguishing star edge coloring of G. The vertex-distinguishing star edge colorings of some particular graphs were obtained. Furthermore, if G(V,E) is a graph with δ⩾5, and n⩽Δ7, then χ′vds(G)⩽14Δ2, where n is the order of G, δ(G) is the minimum degree of G, and Δ(G) is the maximum\linebreak degree of G.
Key words: vertex-distinguishing edge chromatic number, vertex-distinguishing star edge chromatic number, probability method
CLC Number:
O157.5
LIU Xin-sheng, LU Wei-hua. An upper bound for the vertex-distinguishing star edge chromatic number of graphs[J]. Journal of East China Normal University(Natural Sc, 2012, 2012(5): 120-126.
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://xblk.ecnu.edu.cn/EN/
https://xblk.ecnu.edu.cn/EN/Y2012/V2012/I5/120