GraphTheory
IsArchimedeanGraph
test if graph is Archimedean
Calling Sequence
Parameters
Description
Definition
List of Archimedean graphs
Examples
Compatibility
IsArchimedeanGraph(G)
G
-
graph
IsArchimedeanGraph(G) returns true if G is an Archimedean graph and false otherwise.
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
truncated tetrahedron graph
3
12
18
24
cuboctahedron graph
4
48
truncated cube graph
36
truncated octahedron graph
small rhombicuboctahedron graph
great rhombicuboctahedron graph
72
snub cube graph
5
60
icosidodecahedron graph
30
120
truncated dodecahedron graph
90
truncated icosahedron graph
small rhombicosidodecahedron graph
great rhombicosidodecahedron graph
180
snub dodecahedron graph
150
with⁡GraphTheory:
with⁡SpecialGraphs:
SB≔SoccerBallGraph⁡
SB≔Graph 1: an undirected graph with 60 vertices and 90 edge(s)
IsPlanar⁡SB,F
true
nops⁡F
32
IsArchimedeanGraph⁡SB
DrawGraph⁡SB,style=spring
DrawGraph⁡SB,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.
See Also
SpecialGraphs
Download Help Document