冠图C_n■C_m的邻点可区别均匀E-全染色  

The Adjacent-Vertex-Distinguishing-Equitable E-Total Coloring of Graph C_n■C_m

作　　者：魏邦魁 强会英[1] 王洪申[2] 

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

出　　处：《淮阴师范学院学报（自然科学版）》2016年第1期5-10,共6页Journal of Huaiyin Teachers College;Natural Science Edition

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

摘　　要：讨论了冠图C_n■C_m的邻点可区别均匀E-全染色,并得到了它们的邻点可区别均匀E-全色数.对简单图G,如果图G存在一个染色法f,使得任意两个相邻的顶点染不同的颜色;任意一条边与其关联的点染不同的颜色;任意两个相邻的点的色集合不相同,并且任意两色所染元素的数目之差不超过1,则称该染色法为G的邻点可区别均匀E-全染色,其所用最少颜色数称为该图的邻点可区别均匀E-全色数.Let G be a single graph. A total coloring f of G be called adjacent-vertex-distinguishing-equitable E-total coloring,if no two adjacent vertex of G receive same color and no edge associated with vertex assigned the same color,and for any two adjacent vertexes uand v,there must be C（v） ≠ C（ u）,what is more,the difference of the elements colored by any two colors is not more than 1. The minimal number of colors required for theadjacent-vertex-distinguishing-quitable E-total coloring of G is called the adjacent-vertex-distinguishingequita-ble E-total chromatic numbers. In this paper,theadjacent-vertex-distingui shing-equitable E-total coloring of graph C_nοC_m was discussed,and the adjacent-vertex-distinguishing-equitable E-total chromatic numbers of them were obtained.

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

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