Construction of strongly regular graphs having an automorphism group of composite order

DOI10.11575/cdm.v15i1.62323zbMath1475.05175OpenAlexW3025856696MaRDI QIDQ3303514

Dean Crnković, Marija Maksimović

Publication date: 12 August 2020

Full work available at URL: https://cdm.ucalgary.ca/article/download/62323/54015

zbMATH Keywords

automorphism groupstrongly regular graphorbit matrix

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Automorphisms of abstract finite groups (20D45)

Related Items (3)

Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs ⋮ Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry ⋮ Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group

Uses Software

• GAP

Cites Work

• On triple systems and strongly regular graphs
• Constructing cospectral 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
• Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
• 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

This page was built for publication: Construction of strongly regular graphs having an automorphism group of composite order