摘要
图G的正常边染色称为是点可区别的,如果对G的任意两顶点的关联边的颜色构成的集合不同.对图G进行点可区别正常边染色所需要的最少颜色数称为图G的点可区别正常边色数,记为x_s'(G).给出了3阶空图与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 K3cVKt are obtained in this paper.
出处
《数学的实践与认识》
CSCD
北大核心
2014年第21期312-315,共4页
Mathematics in Practice and Theory
基金
国家自然科学基金资助项目(61163037
61163054)
兰州商学院2013年度教学研究一般项目(20130210)
关键词
联图
点可区别正常边染色
点可区别正常边色数
join graph
vertex-distinguishing proper edge coloring
vertex-distinguishing proper edge chromatic number
