Distance transitive graphs with symmetric or alternating automorphism group

DOI10.1017/S0004972700012995zbMath0601.05024MaRDI QIDQ3735727

Cheryl E. Praeger, Martin W. Liebeck, Jan Saxl

Publication date: 1987

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

finite simple groupsdistance-transitive graphs

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subgroups of symmetric groups (20B35)

Related Items (11)

Finite distance-transitive generalized polygons ⋮ Two-distance transitive normal Cayley graphs ⋮ Mobility of vertex-transitive graphs ⋮ Finite primitive distance-transitive graphs ⋮ Distance-transitive representations of the sporadic groups ⋮ Multiplicity-free permutation representations of the symmetric group. ⋮ Affine distance-transitive groups with alternating or symmetric point stabiliser ⋮ On distance transitive graphs whose automorphism groups are affine ⋮ Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\) ⋮ Linear groups and distance-transitive graphs ⋮ Regular subgroups of primitive permutation groups

Cites Work

• On certain maximal subgroups of symmetric or alternating groups
• There are only finitely many finite distance-transitive graphs of given valency greater than two
• On the orders of Primitive Permutation Groups
• Finite Permutation Groups and Finite Simple Groups
• Algebraic Graph Theory
• PRIMITIVE AND IMPRIMITIVE GRAPHS

This page was built for publication: Distance transitive graphs with symmetric or alternating automorphism group