CirculantGraph

CirculantGraph[n,j]

gives the circulant graph with n vertices and jump j.

CirculantGraph[n,{j1,j2,}]

gives the circulant graph with n vertices and jumps j1, j2, .

Details and Options

  • A circulant graph of order n has vertices {1,2,,n} and vertex i is connected to vertices Mod[i-jk,n,1] and Mod[i+jk,n,1] for the jumps j1, j2, .
  • CirculantGraph takes the same options as Graph.

Examples

open allclose all

Basic Examples  (2)

The first few circulant graphs with jump 2:

In[1]:=
Click for copyable input
Out[1]=

The circulant graph with 10 vertices and jumps 2 and 4:

In[1]:=
Click for copyable input
Out[1]=

Options  (79)

Applications  (6)

Properties & Relations  (6)

Possible Issues  (1)

Neat Examples  (2)

See Also

Graph  GraphData  CycleGraph  CompleteGraph

Introduced in 2010
(8.0)