On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph

DOI10.1134/S000143461105004XzbMATH Open1233.05220MaRDI QIDQ650478FDOQ650478

Authors Alexander L. Gavrilyuk, Alexandre A. Makhnev

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixdistance-regular graphisomorphismTerwilliger graphHoffman-Singleton graphregular graph of degree \(k\)

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Recommendations

• Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph
• On distance-regular 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
• Some properties of the Hoffman-Singleton graph
• Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph

Cites work

• A local approach to 1-homogeneous graphs
• A new feasibility condition for distance-regular graphs
• Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph
• On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph

Cited in

(4)

• On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
• Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
• Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph
• Some properties of the Hoffman-Singleton graph

This page was built for publication: On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650478)