CirculantGraph[n,l]
constructs a circulant graph on n vertices, meaning the 
vertex is adjacent to the 
and 
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.
CirculantGraph
CirculantGraph[n,l]
constructs a circulant graph on n vertices, meaning the 
vertex is adjacent to the 
and 
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
- CirculantGraph functionality is now available in the built-in Wolfram Language function CirculantGraph.
- To use CirculantGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (1)
Text
Wolfram Research (2012), CirculantGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.
CMS
Wolfram Language. 2012. "CirculantGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.
APA
Wolfram Language. (2012). CirculantGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html