GraphTheory[SpecialGraphs]
TetrahedronGraph
construct tetrahedron graph
OctahedronGraph
construct octahedron graph
DodecahedronGraph
construct dodecahedron graph
IcosahedronGraph
construct icosahedron graph
Calling Sequence
Parameters
Description
Examples
TetrahedronGraph()
TetrahedronGraph(V1)
OctahedronGraph()
OctahedronGraph(V2)
DodecahedronGraph()
DodecahedronGraph(V3)
IcosahedronGraph()
IcosahedronGraph(V4)
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
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.
with⁡GraphTheory:
with⁡SpecialGraphs:
T≔TetrahedronGraph⁡
T≔Graph 1: an undirected graph with 4 vertices and 6 edge(s)
DrawGraph⁡T
G≔OctahedronGraph⁡
G≔Graph 2: an undirected graph with 6 vertices and 12 edge(s)
IsPlanar⁡G
true
DrawGraph⁡G
H≔DodecahedronGraph⁡
H≔Graph 3: an undirected graph with 20 vertices and 30 edge(s)
Neighborhood⁡H,19
14,18,20
IsPlanar⁡H,F
nops⁡F
12
DrawGraph⁡H
K≔IcosahedronGraph⁡
K≔Graph 4: an undirected graph with 12 vertices and 30 edge(s)
IsPlanar⁡K,F
map⁡nops,F
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
DrawGraph⁡K
See Also
SpecialGraphs
Download Help Document