Pappus graph
From Wikipedia, the free encyclopedia
| Pappus graph | |
 The Pappus graph, a Levi graph with 18 vertices formed from the Pappus configuration. |
|
| Named after | Pappus of Alexandria |
|---|---|
| Vertices | 18 |
| Edges | 27 |
| Properties | Distance-regular Cubic |
In the mathematical field of graph theory, the Pappus graph is a 3-regular graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration. It is a distance-regular graph, one of only 14 such cubic graphs according to Cubic symmetric graphs (The Foster Census). It has crossing number 5, and is the smallest cubic graph with that crossing number (sequence A110507 in OEIS).
The name "Pappus graph" has also been used to refer to a related nine-vertex graph (Kagno 1947).
[edit] References
- Kagno, I. N. (1947), “Desargues' and Pappus' graphs and their groups”, American Journal of Mathematics 69 (4): 859–863, DOI 10.2307/2371806
