On strongly regular graphs with = 1 and their automorphisms

DOI10.1134/S1064562406050073MaRDI QIDQ2477488zbMATH OpenFDO

Authors Ivan Nikolaevich Belousov, Alexandre A. Makhnev

Publication date 13 March 2008

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064562406050073

zbMATH Keywords

graph automorphismsstrongly regular graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• On automorphisms of strongly regular graphs with \lambda=0 and \mu=3
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
• On automorphisms of strongly regular graphs with \lambda=0, \mu=2
• On automorphisms of a strongly regular graph with parameters (95, 40, 12, 20)
• Automorphisms of a strongly regular graph with parameters (392, 115, 18, 40)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57

Cited in

(9)

• \(r\)-regular families of graph automorphisms
• On automorphisms of distance-regular graphs
• On automorphisms of strongly regular graphs with \lambda=0 and \mu=3
• On automorphisms of strongly regular graphs with \lambda=0, \mu=2
• On the automorphism groups of strongly regular graphs. II.
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
• On automorphisms of strongly regular graphs with parameters (320,99,18,36)
• Strongly regular graphs with non-trivial automorphisms
• On automorphisms of semitriangular graphs with = 7

This page was built for publication: On strongly regular graphs with \(\mu = 1\) and their automorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477488)