图K_(3,3)∨K_t的点可区别正常边染色  

On the vertex-distinguishing proper edge-coloring of K_(3,3)∨K_t

作　　者：高毓平[1] 王治文[2] 陈祥恩[1] 姚兵[1] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070 [2]宁夏大学数学计算机学院,宁夏银川750021

出　　处：《山东大学学报（理学版）》2012年第2期60-64,共5页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(61163037;61163054);宁夏大学科学研究基金项目((E):ndzr10-7);西北师大"知识与科技创新工程"项目(nwnu-kjcxgc-03-61)

摘　　要：图G的正常边染色称为是点可区别的,如果对G的任意两个不同的顶点u,v,与u关联的边的颜色构成的集合异于与v关联的边的颜色构成的集合。对图G进行点可区别正常边染色所需要的最少颜色数称为是G的点可区别正常边色数,记为χ's(G)。讨论了图K3,3∨Kt的点可区别正常边染色。A k-proper edge coloring of a simple graph G is called vertex-distinguishing if for two arbitrarily 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 the vertex-distinguishing proper edge chromatic number of G and denoted by χ′s（G）.Vertex-distinguishing proper edge colorings of K3,3∨Kt are discussed.

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

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