华东师范大学学报（自然科学版）Issue(5)：120-126,7.DOI:10.3969/j.issn.1000-5641.2012.05.016
图的点可区别星边色数的一个上界
An upper bound for the vertex-distinguishing star edge chromatic number of graphs
摘要
Abstract
The vertex-distinguishing star edge chromatic number of G,denoted by x'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 X'vds(G) ≤ 142' where n is the order of G,δ(G) is the minimum degree of G,and △(G) is the maximum degree of G.关键词
点可区别边色数/点可区别星边色数/概率方法Key words
vertex-distinguishing edge chromatic number/ vertex-distinguishing star edge chromatic number/ probability method分类
数理科学引用本文复制引用
刘信生,路伟华..图的点可区别星边色数的一个上界[J].华东师范大学学报（自然科学版）,2012,(5):120-126,7.基金项目
甘肃省自然科学基金(No.3ZS051-A25-025) （No.3ZS051-A25-025）
甘肃省教育厅基金项目(0501-03) （0501-03）
