M22 graph
| M22 graph, Mesner graph Edges | 616 | |
|---|---|---|
| Table of graphs and parameters | ||
The M22 graph, also called the Mesner graphiff they have no terms in common or by deleting a vertex and its neighbors from the Higman–Sims graph.[6][7]
For any term, the family of blocks that contain that term forms an
maximum independent sets in this graph.[4]
It is one of seven known
See also
References
- ^ a b "Mesner graph with parameters (77,16,0,4). The automorphism group is of order 887040 and is isomorphic to the stabilizer of a point in the automorphism group of NL2(10)"
- ^ a b Slide 5 list of triangle-free SRGs says "Mesner graph"
- ^ a b Section 3.2.6 Mesner graph
- ^ ISBN 9781107128446
- ^ Technische Universiteit Eindhoven, http://www.win.tue.nl/~aeb/graphs/M22.html. Accessed 29 May 2018.
- ^ a b Weisstein, Eric W. “M22 Graph.” MathWorld, http://mathworld.wolfram.com/M22Graph.html. Accessed 29 May 2018.
- ^ Vis, Timothy. “The Higman–Sims Graph.” University of Colorado Denver, http://math.ucdenver.edu/~wcherowi/courses/m6023/tim.pdf. Accessed 29 May 2018.
- ^ Weisstein, Eric W. “Strongly Regular Graph.” From Wolfram MathWorld, mathworld.wolfram.com/StronglyRegularGraph.html.