Local McLaughlin graph
 | It has been suggested that this article be merged into McLaughlin graph. (Discuss) Proposed since April 2015. |
 | This article needs additional citations for verification. (August 2012) |
| Local McLaughlin Graph | |
|---|---|
 The graph with 9-side symmetric embedding | |
| Vertices | 162 |
| Edges | 4536 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 3 |
| Automorphisms | 13063680 |
| Properties | Strongly regular Symmetric |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the local McLaughlin graph is a regular undirected graph named after group theorist Jack E. McLaughlin with 162 vertices and 4536 edges. It is a strongly regular graph with parameters (162,56,10,24). It is a component of the McLaughlin graph.
External links
- Weisstein, Eric W. "Local McLaughlin Graph". From MathWorld A Wolfram Web Resource.
- Andries E. Brouwer. "U43 (2nd subconstituent of the McLaughlin graph)". Author's personal site.
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |