# Pappus graph

## Bipartite, 3-regular undirected graph / From Wikipedia, the free encyclopedia

In the mathematical field of graph theory, the **Pappus graph** is a bipartite, 3-regular, undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration.^{[1]} It is named after Pappus of Alexandria, an ancient Greek mathematician who is believed to have discovered the "hexagon theorem" describing the Pappus configuration. All the cubic, distance-regular graphs are known; the Pappus graph is one of the 13 such graphs.^{[2]}

**Quick Facts**Named after, Vertices ...

The Pappus graph has rectilinear crossing number 5, and is the smallest cubic graph with that crossing number (sequence A110507 in the OEIS). It has girth 6, diameter 4, radius 4, chromatic number 2, chromatic index 3 and is both 3-vertex-connected and 3-edge-connected. It has book thickness 3 and queue number 2.^{[3]}

The Pappus graph has a chromatic polynomial equal to:

The name "Pappus graph" has also been used to refer to a related nine-vertex graph,^{[4]} with a vertex for each point of the Pappus configuration and an edge for every pair of points on the same line; this nine-vertex graph is 6-regular, is the complement graph of the union of three disjoint triangle graphs, and is the complete tripartite graph K_{3,3,3}. The first Pappus graph can be embedded in the torus to form a self-Petrie dual regular map with nine hexagonal faces; the second, to form a regular map with 18 triangular faces. The two regular toroidal maps are dual to each other.