 GraphTheory/SpecialGraphs/DipoleGraph - Maple Help

GraphTheory[SpecialGraphs]

 DipoleGraph
 construct dipole graph Calling Sequence DipoleGraph(n) Parameters

 n - positive integer Description

 • The DipoleGraph(n) function creates the order n dipole graph, a multigraph with two vertices and n edges between them.
 • The order n dipole graph is the plane dual of the cycle graph on n vertices. Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $\mathrm{DG}≔\mathrm{DipoleGraph}\left(5\right)$
 ${\mathrm{DG}}{≔}{\mathrm{Graph 1: an undirected multigraph with 2 vertices and 5 edge\left(s\right)}}$ (1)
 > $\mathrm{Edges}\left(\mathrm{DG}\right)$
 $\left[\left\{{1}{,}{2}\right\}{,}\left\{{1}{,}{2}\right\}{,}\left\{{1}{,}{2}\right\}{,}\left\{{1}{,}{2}\right\}{,}\left\{{1}{,}{2}\right\}\right]$ (2)
 > $\mathrm{DrawGraph}\left(\mathrm{DG}\right)$ > $\mathrm{PlaneDual}\left(\mathrm{CycleGraph}\left(5\right),\mathrm{multigraph}\right)$
 ${\mathrm{Graph 2: an undirected multigraph with 2 vertices and 5 edge\left(s\right)}}$ (3) Compatibility

 • The GraphTheory[SpecialGraphs][DipoleGraph] command was introduced in Maple 2023.