A circulant graph is a graph of n graph vertices in which the i th graph vertex is adjacent to the (i + j) th and (i - j) th graph vertices for each j in a list l. The circulant graph C i_n(1, 2, ..., ⌊n/2⌋) gives the complete graph K_n and the graph C i_n(1) gives the cyclic graph C_n. The circulant graph on n vertices on an offset list l is implemented in the Wolfram Language as CirculantGraph[n, l]. Precomputed properties are available using GraphData[{ Circulant, { n, l}}]. With the exception of the degenerate case of the path graph P_2, connected circulant graphs are biconnected, bridgeless, cyclic, Hamiltonian, LCF, regular, traceable, and vertex-transitive.

16-cell | Andrásfai graph | antiprism graph | cocktail party graph | complete bipartite graph | complete graph | cycle graph | empty graph | KC graph | Möbius ladder | octahedral graph | Paley graph | pentatope graph | prism graph | rook graph | square graph | tetrahedral graph | torus grid graph | triangle graph | utility graph