摘要
对一个简单图G的一个正常全染色f来说,G的点v的色集合C(V)是与v关联的边的颜色以及点v的颜色所构成的集合.对此f,如果G的任意两个相邻顶点的色集合不同,则称f为G的邻点可区别全染色.对G进行邻点可区别全染色所需要的最少颜色数称为G的邻点可区别全色数.对图rK_2 V K_3的邻点可区别全色数进行了讨论.
For a proper total coloring f of a simple G, the color set of a vertex v of G is the set of colors of edges incident with v together with the color assigned to v. For f, if any pair adjacent vertices have different color sets, then f is called an adjacent-vertex-distinguishing total coloring. The minimum number of colors in an adjacent-vertex-distinguishing total coloring is called the adjacent-vertex-distinguishing total chromatic number of G. The adjacent-vertex-distinguishing total chromatic number of rK2 ∨ Ks is discussed in this paper.
出处
《兰州大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第5期91-93,共3页
Journal of Lanzhou University(Natural Sciences)
基金
国家自然科学基金(10771091)
西北师范大学科技创新工程(NWNU-KJCXGC-3-18)
甘肃省教育厅科研基金(0501-02)资助项目.
关键词
邻点可区别全染色
邻点可区别全色数
联图
adjacent-vertex-distinguishing total coloring
adjacent-vertex-distinguishing total chromatic number
join of graphs
