On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
From MaRDI portal
Publication:1048534
DOI10.1134/S1064562409050093zbMath1285.05153MaRDI QIDQ1048534
Alexander L. Gavrilyuk, Aleksandr Alekseevich Makhnev
Publication date: 12 January 2010
Published in: Doklady Mathematics (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)
Related Items (8)
On automorphisms of strongly regular graphs with parameters (486, 100, 22, 20) ⋮ On strongly regular graphs with eigenvalue 2 and their extensions ⋮ On strongly regular graphs with eigenvalue 3 and their extensions ⋮ On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph ⋮ On graphs in which neighborhoods of vertices are isomorphic to the Higman-Sims graph ⋮ On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph ⋮ Graphs in which neighborhoods of vertices are isomorphic to the Mathieu graph ⋮ Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist
Cites Work
- Unnamed Item
- On graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
- A new feasibility condition for distance-regular graphs
- The connectivity of strongly regular graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- Automorphisms of Terwilliger graphs with μ = 2
- Eigenvalues and the diameter of graphs
This page was built for publication: On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
