Vertices 57 Radius 3 Girth 5 | Edges 171 Diameter 3 Automorphisms 3420 | |
 | ||
In mathematics, the Perkel graph, named after Manley Perkel, is a 6-regular graph with 57 vertices and 171 edges. It is the unique distance-regular graph with intersection array (6, 5, 2; 1, 1, 3). The Perkel graph is also distance-transitive.
It is also the skeleton of an abstract regular polytope, the 57-cell.
References
Perkel graph Wikipedia(Text) CC BY-SA