图K_3~cVK_t的点可区别正常边染色  

On the vertex-distinguishing proper edge-coloring of K_3~c∨K_t

作　　者：王国兴[1] 

机构地区：[1]兰州商学院信息工程学院,甘肃兰州730020

出　　处：《数学的实践与认识》2014年第21期312-315,共4页Mathematics in Practice and Theory

基　　金：国家自然科学基金资助项目(61163037;61163054);兰州商学院2013年度教学研究一般项目(20130210)

摘　　要：图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.

关 键 词：联图 点可区别正常边染色 点可区别正常边色数 

分 类 号：O157.5[理学—数学]