CirculantGraph

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


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.

更多信息和选项更多信息和选项