The Sylvester graph and Moore graphs
From MaRDI portal
Publication:2311364
Recommendations
Cites work
- Antipodal covering graphs
- Cubic Distance-Regular Graphs
- Extremal 1-codes in distance-regular graphs of diameter 3
- Homogeneous graphs and regular near polygons
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- On generalized hexagons and a near octagon whose lines have three points
- On Moore Graphs with Diameters 2 and 3
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(5)- The Gewirtz graph: An exercise in the theory of graph spectra
- Vertex-symmetric generalized Moore graphs.
- Distance-regular graphs admitting a perfect 1-code
- Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
- scientific article; zbMATH DE number 1746576 (Why is no real title available?)
This page was built for publication: The Sylvester graph and Moore graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311364)