花图F_(r.m.n)的邻点可区别全染色

Adjacent Vertex Distinguishing Total Coloring on the Flower Graph

设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.