Pappus graph
From Wikipedia, the free encyclopedia
| Pappus graph | |
 The Pappus graph. |
|
| Named after | Pappus of Alexandria |
|---|---|
| Vertices | 18 |
| Edges | 27 |
| Diameter | 4 |
| Girth | 6 |
| Automorphisms | 216 |
| Chromatic number | 2 |
| Chromatic index | 3 |
| Properties | Symmetric Distance-regular Cubic Hamiltonian |
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[1]. It is a distance-regular graph, one of only 14 such cubic graphs according to 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[2], with a point for each point of the Pappus configuration and an edge for every pair of points on the same line.
[edit] Algebraic properties
The automorphism group of the Pappus graph is a group of order 216. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore the Pappus graph is a symmetric graph. It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the Foster census, the Pappus graph, referenced as F018A, is the only cubic symmetric graph on 18 vertices.[3][4]
[edit] Gallery
 Pappus graph colored to highlight various cycles. |
 The edges of the Pappus graph can be colored using 3 colors. |
 The chromatic number of the Pappus graph is 2. |
[edit] References
- ^ Weistein, Eric W., "Pappus Graph" from MathWorld.
- ^ Kagno, I. N. (1947), "Desargues' and Pappus' graphs and their groups", American Journal of Mathematics 69 (4): 859–863, doi:
- ^ Royle, G. "Cubic Symmetric Graphs (The Foster Census)."
- ^ Conder, M. and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41-63, 2002.
