Circulant graph

For the square matrices, see Circulant matrix.
The Paley graph of order 13, an example of a circulant graph.

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic graph,[1] but this term has other meanings.

  1. ^ Cite error: The named reference ds1 was invoked but never defined (see the help page).