CirculantGraph


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


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

Details and OptionsDetails and Options

New to Mathematica? Find your learning path »
Have a question? Ask support »