CirculantGraph

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

CirculantGraph[n,l]

constructs a circulant graph on n vertices, meaning the ^(th) vertex is adjacent to the ^(th) and ^(th) vertices, for each in list l.

CirculantGraph[n,l]

returns the graph with n vertices in which each is adjacent to and , where l must be an integer.

Details and Options

Examples

Basic Examples  (1)

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

See Also

CirculantGraph  CompleteGraph  Cycle

Tutorials