Automorphism groups of primitive distance-bitransitive graphs are almost simple

DOI10.1016/S0195-6698(87)80010-0zbMATH Open0632.05033OpenAlexW2069277447MaRDI QIDQ1095152FDOQ1095152

Authors: John Shawe-Taylor 

Publication date: 1987

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(87)80010-0

Recommendations

• Distance Transitive Graphs and Finite Simple Groups
• Distance transitive graphs with symmetric or alternating automorphism group
• scientific article; zbMATH DE number 2149411
• On distance transitive graphs whose automorphism groups are affine
• Affine distance-transitive groups with alternating or symmetric point stabiliser

zbMATH Keywords

primitiveHamming graphsalmost simpleimprimitivedistance-transitivedistance-bitransitive pair

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Simple groups: alternating groups and groups of Lie type (20D06)

Cites Work

• Distance-regularised graphs are distance-regular or distance-biregular
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• Antipodal covering graphs
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Distance Transitive Graphs and Finite Simple Groups

Cited In (4)

• Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
• Distance-regularised graphs are distance-regular or distance-biregular
• Distance transitive graphs with symmetric or alternating automorphism group
• Locally \(s\)-distance transitive graphs

This page was built for publication: Automorphism groups of primitive distance-bitransitive graphs are almost simple

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