Question: If a circulant graph has $k$ vertices where k is odd and greater than 1, show that there are atleast $2k$ automorphisms?
I am having trouble with the actual definition of circulant graphs. Given these n vertices, how do I know which vertices are adjacent or not. Also how would I go about doing this proof?
Hint: Prove that any rotation and any reflection is an automorphism of your graph.