Fintte two-arc transitive graphs admitting a suzuki simple group
Fintte two-arc transitive graphs admitting a suzuki simple group
复制标题
DOI:
10.1080/00927879908826659
复制
发表时间:
1999
影响因子:
0.7
通讯作者:
X. Fang;C. Praeger
中科院分区:
文献类型:
--
作者:
X. Fang;C. Praeger
This paper forms part of a program for classifying fi~ lite quasiprimitive 2-arc transitive graphs. In [9] it xas shown that every non-bipartite 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph, and that the quasiprimitive 2-arc transitive graphs may be divided into those of affine type, of almost simple type, of product type, and of twisted wreath type. Here xe consider a family of such graphs of almost simple type namely those with autoinorphisni group belonging to the illfinite family of almost simple groups called the Suzulti groups. Let r be a finite simple undirected graph, that is r consists of a finite vertex set l'r and an edge set Er which may be identified with a subset of unordered pairs from IT. A 2-urc is a triple (ao. nl, az) of vertices such that {ao, all,{al, a2) E Er and a" f a?. Let G be a subgroup of the anton~ orphism group Aut r of r. The graph r is said to be (G, 2)-arc trcmsitice if G is transitive on the set of 2-arcs of r; also r is said to be 2-urc trcznsiticeif it is (Aut r. 2)-arc transitive. Similarly r is said to be (G, 1)-czrc trunsitiue if G is transitive on the 1-arcs of r, that is, on the ordered pairs (ao, al) where {no, al) E ET. A permutation group G on a set R is said to be qucisiprimitive if every nontrivial normal subgroup of G is transitive on Q, and a (G, 2)-arc transitive graph is said to be a quasiprimitice (G, 2)-arc trnnsiti~ 3e graph if G is quasiprimitive on\; r. The quasiprimitive 2-arc transitive graphs of affine type have beein completely classified by Ivanov and the second author in [; I, and Baddeley