A distance-regular graph with the intersection array \8, 7, 5; 1, 1, 4\ and its automorphisms
DOI10.1134/S0081543807050033zbMATH Open1237.05215OpenAlexW2007566347MaRDI QIDQ764684FDOQ764684
Authors: Ivan Nikolaevich Belousov, Alexandre A. 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
Recommendations
- On automorphisms of a distance-regular graph with intersection array \(\{96,76,1;1,19,96\}\)
- Automorphisms of a distance-regular graph with intersection array \(\{45,42,1;1,6,45\}\)
- On automorphisms of a distance-regular graph with intersection array \(\{99, 84, 1; 1, 12, 99\}\)
- On automorphisms of a distance-regular graph with intersection array \(\{35,32,1;1,4,35\}\)
- Automorphisms of Shilla graph with intersection array \(\{115,96,16;1,8,92\}\)
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The characterization of finite groups with abelian Sylow 2-subgroups
- 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
Cited In (4)
This page was built for publication: A distance-regular graph with the intersection array \(\{8, 7, 5; 1, 1, 4\}\) and its automorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764684)
