GraphTheory[SpecialGraphs] - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/PrismGraph

GraphTheory[SpecialGraphs]

  

PrismGraph

  

construct prism graph

  

AntiPrismGraph

  

construct antiprism graph

 

Calling Sequence

Parameters

Description

Details

Examples

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

withGraphTheory:

withSpecialGraphs:

GPrismGraph5

G:=Graph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)

(1)

DrawGraphG

HAntiPrismGraph5

H:=Graph 2: an undirected unweighted graph with 10 vertices and 20 edge(s)

(2)

DrawGraphH

See Also

SpecialGraphs

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam