From Surf Wiki (app.surf) — the open knowledge base
Perkel graph
6-regular graph with 57 vertices and 171 edges
6-regular graph with 57 vertices and 171 edges
| Field | Value | |
|---|---|---|
| name | Perkel graph | |
| image | [[Image:Perkel graph embeddings.svg | 320px]] |
| image_caption | Perkel graphs with 19-fold symmetry | |
| vertices | 57 | |
| edges | 171 | |
| automorphisms | 3420 | |
| radius | 3 | |
| diameter | 3 | |
| girth | 5 | |
| chromatic_number | 3 | |
| properties | Regular, distance-transitive |
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.
The vertex set is Z3 × Z19 where (i,j) is joined to (i+1,k) when (k−j)3 = 26i.
References
- Brouwer, A. E. Perkel Graph. http://www.win.tue.nl/~aeb/graphs/Perkel.html.
- Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. The Perkel Graph for L(2,19). 13.3 in Distance Regular Graphs. New York: Springer-Verlag, pp. 401–403, 1989.
- Perkel, M. Bounding the Valency of Polygonal Graphs with Odd Girth. Can. J. Math. 31, 1307-1321, 1979.
- Perkel, M. *Characterization of in Terms of Its Geometry.*Geom. Dedicata 9, 291-298, 1980.
References
- Coolsaet, K. and Degraer, J. "A Computer Assisted Proof of the Uniqueness of the Perkel Graph." Designs, Codes and Crypt. 34, 155–171, 2005.
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Perkel graph — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report