Analysing finite locally 𝑠-arc transitive graphs
- 25 August 2003
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 356 (1) , 291-317
Abstract
We present a new approach to analysing finite graphs which admit a vertex intransitive group of automorphisms G G and are either locally ( G , s ) (G,s) –arc transitive for s ≥ 2 s \geq 2 or G G –locally primitive. Such graphs are bipartite with the two parts of the bipartition being the orbits of G G . Given a normal subgroup N N which is intransitive on both parts of the bipartition, we show that taking quotients with respect to the orbits of N N preserves both local primitivity and local s s –arc transitivity and leads us to study graphs where G G acts faithfully on both orbits and quasiprimitively on at least one. We determine the possible quasiprimitive types for G G in these two cases and give new constructions of examples for each possible type. The analysis raises several open problems which are discussed in the final section.Keywords
This publication has 22 references indexed in Scilit:
- On the Weiss conjecture for finite locally primitive graphsProceedings of the Edinburgh Mathematical Society, 2000
- A classification of semisymmetric graphs of order 2pqCommunications in Algebra, 2000
- Biprimitive Graphs of Smallest OrderJournal of Algebraic Combinatorics, 1999
- Permutation Groups1999
- Bi-Primitive Cubic Graphs1994
- Two-Arc Transitive Graphs and Twisted Wreath ProductsJournal of Algebraic Combinatorics, 1993
- Automorphisms of Trivalent GraphsAnnals of Mathematics, 1980
- On regular graphs. IIIJournal of Combinatorial Theory, Series B, 1973
- Finite Geometries1968
- Regular line-symmetric graphsJournal of Combinatorial Theory, 1967