Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist
From MaRDI portal
Publication:2058306
DOI10.33048/SEMI.2021.18.082zbMath1475.05054OpenAlexW3212110953MaRDI QIDQ2058306
Marina Sefovna Nirova, Aleksandr Alekseevich Makhnev
Publication date: 8 December 2021
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2021.18.082
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
- Automorphisms of Terwilliger graphs with μ = 2
This page was built for publication: Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist
