Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms

DOI10.26493/2590-9770.1295.25bzbMath1441.05245OpenAlexW3081823777MaRDI QIDQ5121564

Marija Maksimović, Dean Crnković

Publication date: 15 September 2020

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1295.25b

zbMATH Keywords

automorphism groupstrongly regular graphorbit matrix

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30)

Related Items (1)

Unnamed Item

Cites Work

• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Strongly regular graphs with non-trivial automorphisms
• Distance regular graphs of diameter 3 and strongly regular graphs
• Construction of block designs admitting an abelian automorphism group
• A classification of all symmetric block designs of order nine with an automorphism of order six
• Some new symmetric designs with parameters (64, 28, 12)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms