AntiPrismGraph - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

GraphTheory[SpecialGraphs]

 PrismGraph
 construct prism graph
 AntiPrismGraph
 construct antiprism graph

 Calling Sequence PrismGraph(n) AntiPrismGraph(n)

Parameters

 n - positive integer >=3

Description

 • The PrismGraph(n) command returns the prism graph with parameter n. Namely it returns the Cartesian product of CycleGraph(n) and PathGraph(2).
 • The AntiPrismGraph(n) command returns the antiprism graph with parameter n. It is constructed as two cycles on n vertices, with each vertex on the inner cycle connected to two adjacent vertices on the outer cycle.

Details

 • The prism graph with parameter n is the Cayley graph of the dihedral group of degree n.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{PrismGraph}\left(5\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected graph with 10 vertices and 15 edge\left(s\right)}}$ (1)
 > $\mathrm{DrawGraph}\left(G\right)$
 > $H≔\mathrm{AntiPrismGraph}\left(5\right)$
 ${H}{≔}{\mathrm{Graph 2: an undirected graph with 10 vertices and 20 edge\left(s\right)}}$ (2)
 > $\mathrm{DrawGraph}\left(H\right)$