The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as GraphData["TriakisIcosahedralGraph"].
The plots above show the adjacency, incidence, and graph distance matrices for the deltoidal hexecontahedral graph.
The following table summarizes some properties of the graph.
property | value |
automorphism group order | 120 |
characteristic polynomial | |
chromatic number | 4 |
chromatic polynomial | ? |
claw-free | no |
clique number | 4 |
determined by spectrum | ? |
diameter | 4 |
distance-regular graph | no |
dual graph name | truncated dodecahedral graph |
edge chromatic number | 10 |
edge connectivity | 3 |
edge count | 90 |
Eulerian | no |
girth | 3 |
Hamiltonian | no |
Hamiltonian cycle count | 0 |
Hamiltonian path count | 0 |
integral graph | no |
independence number | 20 |
line graph | ? |
perfect matching graph | no |
planar | yes |
polyhedral graph | yes |
polyhedron embedding names | great dodecahedron, great stellated dodecahedron, spikey, triakis icosahedron |
radius | 3 |
regular | no |
square-free | no |
traceable | no |
triangle-free | no |
vertex connectivity | 3 |
vertex count | 32 |