GraphTheory[SpecialGraphs][PrismGraph]
GraphTheory[SpecialGraphs][AntiPrismGraph]
|
Calling Sequence
|
|
PrismGraph(n)
AntiPrismGraph(n)
|
|
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.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
| (1) |
>
|
|
>
|
|
| (2) |
>
|
|
|
|
Download Help Document
Was this information helpful?