GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory[SpecialGraphs]

  

TetrahedronGraph

  

construct tetrahedron graph

  

OctahedronGraph

  

construct octahedron graph

  

DodecahedronGraph

  

construct dodecahedron graph

  

IcosahedronGraph

  

construct icosahedron graph

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

TetrahedronGraph()

TetrahedronGraph(V1)

OctahedronGraph()

OctahedronGraph(V2)

DodecahedronGraph()

DodecahedronGraph(V3)

IcosahedronGraph()

IcosahedronGraph(V4)

Parameters

V1

-

set or list of size 4 (optional)

V2

-

list of size 6 (optional)

V3

-

set or list of size 20 (optional)

V4

-

(optional) list of 12 vertex labels

Description

• 

The TetrahedronGraph command creates the tetrahedron graph (the complete graph) on 4 vertices. As an option, you may input the labels of the vertices as a set or list of size 4.

• 

The OctahedronGraph command creates the octahedron graph on 6 vertices. As an option, you may input the labels of the vertices as a set or list of size 6.

• 

The DodecahedronGraph command creates the dodecahedron graph on 20 vertices. A dodecahedron is a 3-regular and 12-faced planar graph. As an option, you may input the labels of the vertices as a set or list of size 20.

• 

The IcosahedronGraph command creates the icosahedron graph on 12 vertices. An icosahedron is a 5-regular and 20-faced planar graph. As an option, you may input the labels of the vertices as a set or list of size 12.

Examples

withGraphTheory:

withSpecialGraphs:

TTetrahedronGraph

T:=Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)

(1)

DrawGraphT

GOctahedronGraph

G:=Graph 2: an undirected unweighted graph with 6 vertices and 12 edge(s)

(2)

IsPlanarG

true

(3)

DrawGraphG

HDodecahedronGraph

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

(4)

NeighborhoodH,19

14,18,20

(5)

IsPlanarH,'F'

true

(6)

nopsF

12

(7)

DrawGraphH

KIcosahedronGraph

K:=Graph 4: an undirected unweighted graph with 12 vertices and 30 edge(s)

(8)

IsPlanarK,'F'

true

(9)

mapnops,F

3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3

(10)

DrawGraphK

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