Papalocal
Loading…
Papalocal · Things
Work

Brouwer–Haemers graph

Brouwer–Haemers graph is a 20-regular undirected graph with 81 vertices and 810 edges.

All 4 facts, and where they come from

Facts

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

What it is
Hamiltonian graph One source
strongly regular graph One source
Eulerian graph Cited
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 2455835410
Described as
20-regular undirected graph with 81 vertices and 810 edges
Other names
Brouwer-Haemers graph
What it is
Hamiltonian graph; strongly regular graph; Eulerian graph · 1 reference
Named after
Luitzen Egbertus Jan Brouwer
Wikipedias with a page
6

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

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

In the mathematical field of graph theory, the Brouwer–Haemers graph is a 20-regular undirected graph with 81 vertices and 810 edges.
It is a strongly regular graph, a distance-transitive graph, and a Ramanujan graph. Although its construction is folklore, it was named after Andries Brouwer and Willem H. Haemers, who proved its uniqueness as a strongly regular graph.

From the Wikipedia article “Brouwer–Haemers graph” (en.wikipedia.org/wiki/Brouwer–Haemers_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: Brouwer Haemers graph.svg · See Commons file page

People connected 1

Known for it