摘要
单图G的邻点可区别的非正常全染色是指图的任意相邻两顶点的色集合都不同的全染色.所谓顶点的色集合是指顶点自身的颜色及与其关联的所有边的颜色的集合.文中讨论了笛卡儿积图C_m^2×S_n和C_m^2×F_n的邻点可区别非正常全染色,并给出了相应色数.
The general neighbour-distinguishing total coloring of graph G is the total coloring that the color set of adjacent vertices are different.The color set of a vertex is the color of all edges incident to the vertex and the color of vertex.In this paper,we obtain the general neighbour-distinguishing total chromatic number of C_m2×S_n and C_m2×F_n.
出处
《河西学院学报》
2011年第2期50-53,共4页
Journal of Hexi University
基金
国家自然科学基金资助项目(10771091)
甘肃省教育厅科研资助项目(0501-02)
关键词
邻点可区别的非正常全染色
邻点可区别的非正常全色数
General neighbour-distinguishing total coloring
General neighbour-distinguishing total chromatic number