refined conjecture, these special circulant graphs should have the property that all of their symmetries come from symmetries of the underlying additive group of numbers modulo . It was proven by two groups in 2001 and 2002. Algorithmic questions There is a polynomial-time recognition algorithm for circulant graphs, and the isomorphism problem for circulant graphs can be solved in polynomial time. References External links Graph families Regular graphs