首页 | 本学科首页   官方微博 | 高级检索  
     检索      

A Family of Non-quasiprimitive Graphs Constructed From PSU3(q) Where q Is Odd
作者姓名:Shi  Feng  DING
作者单位:Department of Mathematics, Central South University, Changsha 410075, P. R. China
基金项目:This work is supported by the National Natural Science Foundation of China (10471152)Acknowledgements The paper was written during the time the author held a post-doctoral position at Central South University.
摘    要: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.

关 键 词:图表  2-弧传递  数学模型  数学分析

A family of non-quasiprimitive graphs constructed from PSU3(q) where q is odd
Shi Feng DING.A family of non-quasiprimitive graphs constructed from PSU3(q) where q is odd[J].Acta Mathematica Sinica,2008,24(7):1155-1162.
Authors:Shi Feng Ding
Institution:(1) Department of Mathematics, Central South University, Changsha, 410075, P. R. China
Abstract: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 = 23m with m an odd integer. In this paper we investigate the case where q is an odd prime power. This work is supported by the National Natural Science Foundation of China (10471152)
Keywords:graph  2-arc transitive  PSU3(q)
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号