Circulant graph — циркулянтный граф.
1. Let be a positive integer and be a subset of , such that implies . A circulant graph has vertices and two vertices and are adjacent if and only if , where subtraction is carried out modulo . The adjacency matrix of a circulant graph is a symmetric circulant.
2. (A circulant graph ). The circulant graph with is defined as follows. The vertex set is , and the edge set is , such that .
3. (A circulant graph ). The circulant graph has vertices . is the set of vertices, and An edge between and will have the label . It is easy to see that is a Cayley graph defined on an abelian group.
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.