GraphTheory
IsArchimedeanGraph
test if graph is Archimedean
IsPlatonicGraph
test if graph is Platonic
Calling Sequence
Parameters
Description
Definitions
List of Platonic graphs
List of Archimedean graphs
Examples
Compatibility
IsArchimedeanGraph(G)
IsPlatonicGraph(G)
G
-
graph
IsArchimedeanGraph(G) returns true if G is an Archimedean graph and false otherwise.
IsPlatonicGraph(G) returns true if G is an Platonic graph and false otherwise.
A Platonic graph is a graph that forms the graph skeleton of one of the Platonic solids. There are 5 Platonic graphs, and all of them are regular, polyhedral, planar, and Hamiltonian.
An Archimedean graph is a graph that forms the graph skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, and all of them are regular, polyhedral, planar, and Hamiltonian.
Name
Degree
Vertices
Edges
Order of Automorphism Group
cube graph
3
8
12
48
dodecahedron graph
20
30
120
icosahedron graph
5
octahedron graph
4
6
tetrahedron graph
24
truncated tetrahedron graph
18
cuboctahedron graph
truncated cube graph
36
truncated octahedron graph
small rhombicuboctahedron graph
great rhombicuboctahedron graph
72
snub cube graph
60
icosidodecahedron graph
truncated dodecahedron graph
90
truncated icosahedron graph
small rhombicosidodecahedron graph
great rhombicosidodecahedron graph
180
snub dodecahedron graph
150
withGraphTheory:
withSpecialGraphs:
SB≔SoccerBallGraph
SB≔Graph 1: an undirected graph with 60 vertices and 90 edges
IsPlanarSB,F
true
nopsF
32
IsPlatonicGraphSB
false
IsArchimedeanGraphSB
DrawGraphSB,style=spring
DrawGraphSB,style=spring,dimension=3
The GraphTheory[IsArchimedeanGraph] command was introduced in Maple 2024.
For more information on Maple 2024 changes, see Updates in Maple 2024.
The GraphTheory[IsPlatonicGraph] command was introduced in Maple 2025.
For more information on Maple 2025 changes, see Updates in Maple 2025.
See Also
SpecialGraphs
Download Help Document