On the independence number of circulant graphs

Let G=(V(G), E(G)) be a simple finite undirected graph. A set S⊆V(G) is an independent set if no two vertices of S are adjacent. The independence number α(G) is the maximum cardinality of an independent set in G. In this paper, we investigate the independence number of circulant graphs, and give the exact values of C(n; {1, k})for k=2, 3, 4, 5 and odd k with even n.