construct prism graph
construct antiprism graph
positive integer >=3
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.
The prism graph with parameter n is the Cayley graph of the dihedral group of degree n.
G≔Graph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)
H≔Graph 2: an undirected unweighted graph with 10 vertices and 20 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)