Papalocal
Loading…
Papalocal · Things
Work

Schläfli graph

Schläfli graph is a 16-regular graph with 27 vertices and 216 edges.

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
claw-free graph One source
strongly regular graph One source
Named after
Ludwig Schläfli One source

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 19, 2026 · revision 2455835439
Described as
16-regular graph with 27 vertices and 216 edges
What it is
undirected graph; claw-free graph; strongly regular graph
Named after
Ludwig Schläfli
Wikipedias with a page
5

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

What Wikipedia says · copied November 19, 2026 · revision 1355431644

In the mathematical field of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges. It is a strongly regular graph with parameters srg(27, 16, 10, 8).

From the Wikipedia article “Schläfli graph” (en.wikipedia.org/wiki/Schläfli_graph), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; 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: Schläfli graph.svg · See Commons file page

People connected 1

Known for it