图W_(n,2)与图F_(n,2)的邻点可区别均匀E-全染色  

The Adjacent-vertex-distinguishing-equitable E-Total Coloring of Graph W_(n,2) and F_(n,2) Graph

作　　者：张彩霞[1] 强会英[1] 张园萍[1] 

机构地区：[1]兰州交通大学数理学院,甘肃兰州730070

出　　处：《洛阳理工学院学报（自然科学版）》2014年第4期73-77,共5页Journal of Luoyang Institute of Science and Technology：Natural Science Edition

基　　金：国家自然科学基金(11161028);甘肃省自然科学基金(1010RJZA076)

摘　　要：对简单图G,如果图G存在一个染色法f,使得任意两个相邻的顶点染不同的颜色;任意一条边与其关联的点染不同的颜色;任意两个相邻的点的色集合不相同,并且任意两色所染元素的数目之差不超过1,则称该染色法f为G的邻点可区别均匀E-全染色,其所用最少颜色数称为该图的邻点可区别均匀E-全色数。讨论了图Wn,2与图Fn,2的邻点可区别均匀E-全染色,并得到了它们的均匀E-全色数。Given a simple graph G,its f-coloring will be called the adjacent-vertex-distinguishing-equitable E-total coloring of G when no two adjacent vertexes of G receive the same color; no edge associated with vertex is assigned the same color; no two adjacent vertexes have identical polychromatic sets and the difference of the elements colored by any two colors is no more than 1.The minimal number of colors required for the adjacent-vertex-distinguishing-equitable E-total coloring of G is called the adjacent-vertex-distinguishing-equitable E-total chromatic numbers.This paper discusses about the adjacent-vertex-distinguishing-equitable En,2Wn,2-total coloring of graph and graph F and works out their adjacent-vertex-distinguishing-equitable E-total chromatic numbers.

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

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