| Display title | Brouwer–Haemers graph |
| Default sort key | Brouwer-Haemers Graph |
| Page length (in bytes) | 6,492 |
| Namespace ID | 0 |
| Page ID | 307388 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>ScienceGen |
| Date of page creation | 16:14, 6 February 2024 |
| Latest editor | imported>ScienceGen |
| Date of latest edit | 16:14, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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... |
