Brouwer–Haemers graph
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.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Brouwer–Haemers graph
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.
has abstract
In the mathematical field of g ...... s as a strongly regular graph.
@en
Le graphe de Brouwer-Haemers e ...... ier de paramètres (81,20,1,6).
@fr
No campo da matemática da teor ...... com parâmetros (81, 20, 1, 6).
@pt
Граф Брауэра — Хемерса — это 2 ...... стве строго регулярного графа.
@ru
Wikipage page ID
28,189,558
page length (characters) of wiki page
Wikipage revision ID
926,597,537
Link from a Wikipage to another Wikipage
automorphisms
chromatic number
name
Brouwer–Haemers graph
@en
vertices
wikiPageUsesTemplate
hypernym
type
comment
In the mathematical field of g ...... s as a strongly regular graph.
@en
Le graphe de Brouwer-Haemers e ...... ier de paramètres (81,20,1,6).
@fr
No campo da matemática da teor ...... com parâmetros (81, 20, 1, 6).
@pt
Граф Брауэра — Хемерса — это 2 ...... стве строго регулярного графа.
@ru
label
Brouwer–Haemers graph
@en
Grafo de Brouwer-Haemers
@pt
Graphe de Brouwer-Haemers
@fr
Граф Брауэра — Хемерса
@ru