The Uniform Chromatic Number of Circulant Graph
Junlei Zhu · Jilin Normal University Journal · 2009
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.χe(G)=min{k| graph GT has k-Uniform staining}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),Cn(1,2,3),Cn(1,2,3,4).