Wolfram ResearchProductsPurchasingServices & ResourcesAbout UsOur Sites
Combinatorica Package >

CirculantGraph

CirculantGraph[n, l]
constructs a circulant graph on n vertices, meaning the i^(th) vertex is adjacent to the (i+j)^(th) and (i-j)^(th) vertices, for each j in list l.
CirculantGraph[n, l]
returns the graph with n vertices in which each i is adjacent to (i+l) and (i-l), where l must be an integer.
© 2008 Wolfram Research, Inc. japanese.gif
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team