A Family of Non-quasiprimitive Graphs Constructed From PSU_3(q) Where q Is Odd  

作　　者：Shi Feng DING 

机构地区：[1]Department of Mathematics, Central South University, Changsha 410075, P. R. China

出　　处：《Acta Mathematica Sinica,English Series》2008年第7期1155-1162,共8页数学学报（英文版）

基　　金：the National Natural Science Foundation of China (10471152)

摘　　要：Let Г be a simple connected graph and let G be a group of automorphisms of Г. Г is said to be （G, 2）-arc transitive if G is transitive on the 2-arcs of Г. It has been shown that there exists a family of non-quasiprimitive （PSU3（q）, 2）-arc transitive graphs where q = 2^3m with m an odd integer. In this paper we investigate the case where q is an odd prime power.Let Г be a simple connected graph and let G be a group of automorphisms of Г. Г is said to be （G, 2）-arc transitive if G is transitive on the 2-arcs of Г. It has been shown that there exists a family of non-quasiprimitive （PSU3（q）, 2）-arc transitive graphs where q = 2^3m with m an odd integer. In this paper we investigate the case where q is an odd prime power.

关 键 词：graph 2-arc transitive PSU3（q） 

分 类 号：O21[理学—概率论与数理统计]