On a reduction theorem for finite, bipartite 2-arc-transitive graphs
On a reduction theorem for finite, bipartite 2-arc-transitive graphs
复制标题
DOI:
--
复制
发表时间:
1993
期刊:
影响因子:
--
通讯作者:
C. Praeger
中科院分区:
文献类型:
--
作者:
C. Praeger
Let r be a finite connecied regular bipartite 2-arc transitive graph. It is shown that r is a cover of a possibly smaller graph :E, which is also connecied and regular of the same valency as r, and there is a subgroup G of Aut :E such that G is 2-arc transitive on :E and every nontrivial normal subgroup of G has at most two orbits on vertices. Such graphs :E for which the subgroup G has an abelian normal subgroup with two orbits are investigated. It is shown that :E is a 2-arc transitive Cayley graph for either (a) an elementary abelian 2-group, or (b) a group , where N is an elementary abelian group of odd order and T, an element of order 2, inverts every element of N. The graphs :E arising in (a) have been classified recently by A.A. Ivanov and the author.