construct circulant graph
positive integer or list of positive integers
The CirculantGraph(n,k) command returns the circulant graph on n vertices with jump parameter k.
The circulant graph is a graph on n vertices in which vertex i is connected to vertices i-j and i+j for each j in k.
C_7_12≔Graph 1: an undirected unweighted graph with 7 vertices and 14 edge(s)
The GraphTheory[SpecialGraphs][CirculantGraph] command was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)