两类3正则图的邻点可区别E全染色  

On Adjacent Vertex-Distinguishing E-Total Coloring of Two Kinds of 3-Regular Graphs

作　　者：杨随义[1] 邵海琴[1] 何万生[1] 

机构地区：[1]天水师范学院数学与统计学院,甘肃天水741001

出　　处：《西南师范大学学报（自然科学版）》2013年第3期36-41,共6页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：甘肃省自然科学基金(096RJZE106);天水师范学院中青年教师科研资助项目(TSY201206)

摘　　要：应用构造具体染色的方法得到了两类3-正则图的邻点可区别E-全色数,进一步验证了关于图的邻点可区别E-全染色的猜想.The adjacent vertex-distinguishing E-total chromatic number of two kinds of 3-regular Graphs has been obtained by constructing concrete coloring,and the conjecture on the adjacent vertex-distinguishing E-total coloring of graphs proved through the adjacent vertex-distinguishing E-total coloring of two kinds of 3-regular Graphs.

关 键 词：E-全染色 邻点可区别E-全染色 邻点可区别E-全色数 

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