The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as GraphData["PentagonalHexecontahedralGraph"].
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.
automorphism group order | 60 |
characteristic polynomial | |
chromatic number | 3 |
chromatic polynomial | ? |
claw-free | no |
clique number | 2 |
determined by spectrum | ? |
diameter | 10 |
distance-regular graph | no |
dual graph name | snub dodecahedral graph |
edge chromatic number | 5 |
edge connectivity | 3 |
edge count | 150 |
Eulerian | no |
girth | 5 |
Hamiltonian | yes |
Hamiltonian cycle count | ? |
Hamiltonian path count | ? |
integral graph | no |
independence number | ? |
line graph | ? |
perfect matching graph | no |
planar | yes |
polyhedral graph | yes |
radius | 9 |
regular | no |
square-free | yes |
traceable | yes |
triangle-free | yes |
vertex connectivity | 3 |
vertex count | 92 |