图M(S_n)和M(F_n)的点可区别均匀边色数  

On vertex-distinguishing-equitable edge chromatic number of M(S_n) and M(F_n) graph

作　　者：马刚[1] 马少仙[1] 马效敏[2] 

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730124 [2]西北民族大学科研处,甘肃兰州730030

出　　处：《纯粹数学与应用数学》2012年第5期580-584,共5页Pure and Applied Mathematics

基　　金：西北民族大学中央高校基本科研业务费专项资金(ZYZ2011082);西北民族大学中青年科研项目(X2007-012)

摘　　要：如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色(VDEEC),其所用最少染色数称为点可区别均匀边色数.本文用构造法研究了一些Mycielski图的点可区别均匀边染色,得到了星和扇的Mycielski图的点可区别均匀边色数,验证了它们满足点可区别均匀边染色猜想.A proper edge coloring of graph G is called vertex-distinguishing-equitable edge coloring（VDEEC） if colored sets from any two vertices incident edge are different, and the number of edges in any two color classes differ by at most one, which the required minimum number of colors is called the vertex-distinguishing-equitable edge chromatic number. In this paper, we obtain the vertex-distinguishing-equitable edge chromatic numbers of mycielski graphs of star and fan by using constructive method, which satisfy the conjecture on VDEEC.

关 键 词：MYCIELSKI图 点可区别均匀边染色 点可区别均匀边色数 

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