Skip Navigation

Journal of the London Mathematical Society 2002 66(3):563-578; doi:10.1112/S0024610702003666
© 2002 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fang, X. G.
Right arrow Articles by Wang, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

On the Automorphism Groups of Cayley Graphs of Finite Simple Groups

Xin Gui Fang, Cheryl E. Praeger and Jie Wang

Key Laboratory of Pure and Applied Mathematics, School of Mathematical Sciences, Peking University Beijing 100871, China, xgfang{at}sxx0.math.pku.edu.cn
Key Laboratory of Pure and Applied Mathematics, School of Mathematical Sciences, Peking University Beijing 100871, China, wangj{at}pku.edu.cn
Department of Mathematics and Statistics, University of Western Australia 35 Stirling Highway, Crawley, WA 6009, Australia, praeger{at}maths.uwa.edu.au

Received 20 April 2001. Revision received 21 March 2002.

Let G be a finite nonabelian simple group and let {Gamma} be a connected undirected Cayley graph for G. The possible structures for the full automorphism group Aut{Gamma} are specified. Then, for certain finite simple groups G, a sufficient condition is given under which G is a normal subgroup of Aut{Gamma}. Finally, as an application of these results, several new half-transitive graphs are constructed. Some of these involve the sporadic simple groups G = J1, J4, Ly and BM, while others fall into two infinite families and involve the Ree simple groups and alternating groups. The two infinite families contain examples of half-transitive graphs of arbitrarily large valency.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.