Combinatorica`
Combinatorica`

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)

Wolfram Research (2012), CirculantGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.

Text

Wolfram Research (2012), CirculantGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.

BibTeX

@misc{reference.wolfram_2021_circulantgraph, author="Wolfram Research", title="{CirculantGraph}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html}", note=[Accessed: 27-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_circulantgraph, organization={Wolfram Research}, title={CirculantGraph}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html}, note=[Accessed: 27-September-2021 ]}

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