Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph

DOI10.1134/S008154380907013XzbMath1237.05059OpenAlexW2041100538MaRDI QIDQ764738

Aleksandr Alekseevich Makhnev

Publication date: 14 March 2012

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s008154380907013x

zbMATH Keywords

distance-regular graphlocally \(\mathcal F\)-graphHoffman-Singleton graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (2)

On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton 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
• A new feasibility condition for distance-regular graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Interlacing eigenvalues and graphs

This page was built for publication: Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph