Automorphism groups of primitive distance-bitransitive graphs are almost simple

DOI10.1016/S0195-6698(87)80010-0zbMath0632.05033OpenAlexW2069277447MaRDI QIDQ1095152

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

zbMATH Keywords

primitiveHamming graphsalmost simpleimprimitivedistance-transitivedistance-bitransitive pair

Mathematics Subject Classification ID

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

Related Items (2)

Distance-regularised graphs are distance-regular or distance-biregular ⋮ Locally s-distance transitive graphs

Cites Work

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

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