On the automorphism groups of strongly regular graphs. II.

DOI10.1016/j.jalgebra.2014.09.007zbMath1350.20003OpenAlexW2039818098MaRDI QIDQ468725

László Babai

Publication date: 7 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.09.007

zbMATH Keywords

strongly regular graphsprimitive permutation groupscoherent configurationsautomorphism groups of graphs

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Primitive groups (20B15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

On fixity of arc-transitive graphs ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Permutation groups with restricted stabilizers ⋮ On the automorphism groups of rank-4 primitive coherent configurations ⋮ SIMPLE GROUPS, PRODUCT ACTIONS, AND GENERALIZED QUADRANGLES ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ On the number of fixed points of automorphisms of vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic Delsarte cliques in distance-regular graphs
• On minimal degrees and base sizes of primitive permutation groups
• Quasi-residual 2-designs, 1,5-designs, and strongly regular multigraphs
• On the diameter of Cayley graphs of the symmetric group
• Explicit construction of linear sized tolerant networks
• On the order of doubly transitive permutation groups
• On the order of uniprimitive permutation groups
• On the orders of primitive groups with restricted nonabelian composition factors
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Galois correspondence between permutation groups and cellular rings (association schemes)
• Improvement of Bruck's completion theorem
• On the diameter of permutation groups
• Line graphs, root systems, and elliptic geometry
• Strongly regular graphs with smallest eigenvalue -m
• On a characterization of bilinear forms graphs
• On the orders of doubly transitive permutation groups, elementary estimates
• On the degree of transitivity of permutation groups: A short proof
• On the orders of primitive groups
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Faster Canonical Forms for Primitive Coherent Configurations
• On the automorphism groups of strongly regular graphs I
• THE MAXIMALITY OF CERTAIN WREATH PRODUCTS IN ALTERNATING AND SYMMETRIC GROUPS
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Finite Permutation Groups and Finite Simple Groups
• Simple groups, permutation groups, and probability
• Fast Management of Permutation Groups I
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Quasipolynomial-time canonical form for steiner designs
• Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
• The Order of Automorphisms of Quasigroups

This page was built for publication: On the automorphism groups of strongly regular graphs. II.