Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
From MaRDI portal
Publication:2333615
DOI10.3390/sym10060212zbMath1423.05197OpenAlexW2805198538WikidataQ129707059 ScholiaQ129707059MaRDI QIDQ2333615
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10060212
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- On triple systems and strongly regular graphs
- 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
- On symmetric block designs (40,13,4) with automorphisms of order 5
- Construction of strongly regular graphs having an automorphism group of composite order
- 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)