循环图的均匀色数

The Uniform Chromatic Number of Circulant Graph

图G(A,E)的k-染色称为G(V,E)的k-均匀染色,当且仅当任意两个色类中的元素总数至多相差1.χe(G)=min{k|图G有k-均匀染色}称为G的均匀色数.本文计算了循环图Cn(1),Cn(1,2),Cn(1,2,3),Cn(1,2,3,4)的均匀色数.

The k-stuining of graph G（ V. E） is called k-Uniform staining, if and only if the difference between the total Number of elements in any two color category up to 1. Xe （G） = min｜ k ｜ graph GT has k-Uniform stainingt is called uniform chromatic number of G. In this paper, we will calculate the uniform chromatic number of circulant graph Cn （1）, Cn（1,2）, Ca（1,2,3）, Cn（1,2,3,4）.