On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
From MaRDI portal
Publication:4742690
Recommendations
- On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group \(M_{12}\))
- An alternative approach to the classification of the regular near hexagons with parameters \((s,t,t_2)=(2,11,1)\).
- Two combinatorial structures in the binary Golay code of length \(24\)
- scientific article; zbMATH DE number 3867352
- scientific article; zbMATH DE number 3872159
Cited in
(12)- The Terwilliger algebras of bipartite P- and Q-polynomial schemes
- Some formulas for spin models on distance-regular graphs
- On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group \(M_{12}\))
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Almost 2-homogeneous bipartite distance-regular graphs
- Locally triangular graphs and rectagraphs with symmetry
- Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs
- Distance-regular graphs of Hamming type
- Distinguishing graphs via cycles
- scientific article; zbMATH DE number 2192160 (Why is no real title available?)
- On subgraphs in distance-regular graphs
- Distinguishing graphs via cycles
This page was built for publication: On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742690)