Circulant graph

For the square matrices, see Circulant matrix.
The Paley graph of order 13, an example of a circulant graph, , connecting adjacent vertices, every 3rd vertex, and every 4th vertex. It is self-complementary, as .

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, but this term has other meanings.

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.