Papalocal
Loading…
Papalocal · Things
Work

Pappus graph

Pappus graph is a graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration.

All 4 facts, and where they come from

Facts

4 facts · 0 confirmed by two sources · 0 cited · 4 from one source

What it is
undirected graph One source
bipartite graph One source
symmetric graph One source
Named after

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2489012558
Described as
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
What it is
undirected graph; bipartite graph; symmetric graph
Named after
Pappus of Alexandria
Wikipedias with a page
7

Wikidata item Q3115526 (wikidata.org/wiki/Q3115526), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1328294348

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. 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.
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.
The graph is 1-planar.
The Pappus graph has a chromatic polynomial equal to:
(x−1)x(x16−26x15+325x14−2600x13+14950x12−65762x11+229852x10−653966x9+1537363x8−3008720x7+4904386x6−6609926x5+7238770x4−6236975x3+3989074x2−1690406x+356509)
The name "Pappus graph" has also been used to refer to a related nine-vertex graph, 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 K3,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.

From the Wikipedia article “Pappus graph” (en.wikipedia.org/wiki/Pappus_graph), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

Picture: Wikimedia Commons: Граф Паппа.png · See Commons file page

People connected 1

Known for it