Symmetric cubic graphs with solvable automorphism groups

被引:16
|
作者
Feng, Yan-Quan [1 ]
Li, Cai Heng [2 ]
Zhou, Jin-Xin [1 ]
机构
[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
[2] Univ Western Australia, Sch Math & Stat, Crawley, WA 6009, Australia
基金
中国国家自然科学基金;
关键词
VERTEX-TRANSITIVE GRAPHS; NON-CAYLEY GRAPHS; ORDER TWICE; PRIME; COVERINGS; PRODUCT;
D O I
10.1016/j.ejc.2014.10.008
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A cubic graph Gamma is G-arc-transitive if G <= Aut( Gamma) acts transitively on the set of arcs of Gamma, and G-basic if Gamma is G-arc-transitive and G has no non-trivial normal subgroup with more than two orbits. Let G be a solvable group. In this paper, we first classify all connected G-basic cubic graphs and determine the group structure for every G. Then, combining covering techniques, we prove that a connected cubic G-arc-transitive graph is either a Cayley graph, or its full automorphism group is of type 2(2), that is, a 2-regular group with no involution reversing an edge, and has a non-abelian normal subgroup such that the corresponding quotient graph is the complete bipartite graph of order 6. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条