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

Online Help

All Products    Maple    MapleSim


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

-

(optional) list of 4 vertex labels

V2

-

(optional) list of 6 vertex labels

V3

-

(optional) list of 20 vertex labels

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

TGraph 1: an undirected graph with 4 vertices and 6 edge(s)

(1)

DrawGraphT

GOctahedronGraph

GGraph 2: an undirected graph with 6 vertices and 12 edge(s)

(2)

IsPlanarG

true

(3)

DrawGraphG

HDodecahedronGraph

HGraph 3: an undirected graph with 20 vertices and 30 edge(s)

(4)

NeighborhoodH,19

14,18,20

(5)

IsPlanarH,F

true

(6)

nopsF

12

(7)

DrawGraphH

KIcosahedronGraph

KGraph 4: an undirected 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