图K_(2n)\E(K_(1,m))(n≥2)的点可区别边染色  

Vertex-Distinguishing Edge Coloring of K_(2n)\E(K_(1,m))(n≥2)

作　　者：李敬文[1] 王鸿杰[2] 文飞[2] 胡晓辉[1] 

机构地区：[1]兰州交通大学电子与信息工程学院,兰州730070 [2]兰州交通大学数理与软件工程学院,兰州730070

出　　处：《西南大学学报（自然科学版）》2012年第8期86-90,共5页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61163009)

摘　　要：图的一个正常边染色被称为点可区别边染色若任意两点的色集合不相等,其所得的最少颜色数称为点可区别边色数.应用平行线法研究了图K2n\E(K1,m)(n≥2)的点可区别边染色,并得到了其点可区别边色数,进一步验证了图的点可区别边染色猜想.A proper edge coloring of a graph such that no two vertices have the same color set（where the color set consists of assigning the incident edges in the graph） is called vertex distinguishing edge coloring,the minimal number of coloring is called vertex distinguishing edge chromatic number,where the color set is made up of the incident edge’s color.In this paper,the vertex distinguishing edge chromatic number of K2n／E（K1,m）（n≥2） is discussed with the parallel method.Moreover,the conjecture of vertex distinguishing edge coloring is checked.

关 键 词：偶阶完全图 点可区别边染色 点可区别边色数 

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