Automorphisms of a strongly regular graph with parameters \((1305, 440, 115, 165)\)

DOI10.1134/S0081543819020123zbMath1417.05251MaRDI QIDQ2317368

Madina Mukhadinovna Khamgokova, Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 9 August 2019

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

zbMATH Keywords

strongly regular graphpseudogeometric graphisoregular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Search for properties of the missing Moore graph
• The Gewirtz graph: An exercise in the theory of graph spectra
• Finite simple groups with narrow prime spectrum.
• Automorphisms of a strongly regular graph with parameters \((532,156,30,52)\)
• The nonexistence of certain tight spherical designs
• On tight spherical designs

This page was built for publication: Automorphisms of a strongly regular graph with parameters \((1305, 440, 115, 165)\)