CirculantGraph - Maple Help

GraphTheory[SpecialGraphs]

 CirculantGraph
 construct circulant graph

 Calling Sequence CirculantGraph(n, k)

Parameters

 n - positive integer k - positive integer or list of positive integers

Description

 • The CirculantGraph(n,k) command returns the circulant graph on n vertices with jump parameter k.

Definition

 • 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.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $\mathrm{C_7_12}≔\mathrm{CirculantGraph}\left(7,\left[1,2\right]\right)$
 ${\mathrm{C_7_12}}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 7 vertices and 14 edge\left(s\right)}}$ (1)
 > $\mathrm{DrawGraph}\left(\mathrm{C_7_12}\right)$

Compatibility

 • The GraphTheory[SpecialGraphs][CirculantGraph] command was introduced in Maple 2019.
 • For more information on Maple 2019 changes, see Updates in Maple 2019.