A distance-regular graph with the intersection array \(\{8, 7, 5; 1, 1, 4\}\) and its automorphisms

DOI10.1134/S0081543807050033zbMath1237.05215OpenAlexW2007566347MaRDI QIDQ764684

Ivan Nikolaevich Belousov, 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/s0081543807050033

zbMATH Keywords

pseudogeometric graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (1)

On automorphisms of distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thompson's problem (\(\sigma^2=3\)) With two appendices. I: The numerical verification of Thompson's identity by Andrew Odlyzko: II: A check of the Ree group conjecture for small fields by David Hunt
• The characterization of finite groups with abelian Sylow 2-subgroups

This page was built for publication: A distance-regular graph with the intersection array \(\{8, 7, 5; 1, 1, 4\}\) and its automorphisms