摘要
设G是阶数不小于3的简单连通图,G的k-正常全染f色称为是邻点可区别的,如果对G的任意相邻的两顶点,其点的颜色及关联边的颜色构成的集合不同。这样的k中最小者称为是G的邻点可区别全色数。得到了花图的邻点可区别全色数。
Let G be a simple connected graph. A k-proper total coloring of G is called adjacent distinguishing if for arbitrary two adjacent vertices u and v, C（ u ）≠C（v） ,where C（ u ） is the set of the colors of u and edges which is adjacent to u. The minimum k such that G has a k-adjacent-vertex-distinguishing total coloring is called the adjacent vertex distinguishing total chromatic number. The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
出处
《山东科技大学学报（自然科学版）》
CAS
2005年第4期93-94,98,共3页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
花图
全染色
邻点可区别全染色
flower graph
total coloring
adjacent vertex distinguishing total coloring
作者简介
任淑红（1978-），女，山东德州人，硕士研究生，主要从事图论方面的研究．
