Brouwer–Haemers graph
id:
brouwer-haemers-graph-279-13531246
title:
Brouwer–Haemers graph
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Brouwer%E2%80%93Haemers_graph
date created:
date modified:
2023-08-19T00:30:45Z
main entity:
{"identifier":"Q939219","url":"https://www.wikidata.org/entity/Q939219"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b1/Brouwer_Haemers_graph.svg","width":800,"height":800}
fields total:
13
integrity:
14