Arc-transitive pentavalent Cayley graphs with soluble vertex stabilizer on finite nonabelian simple groups
Combinatorics
2017-02-21 v1
Abstract
A Cayley graph is said to be normal if is normal in . The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the full automorphism groups of Cayley graphs. In this paper, we investigate the normality problem of the connected arc-transitive pentavalent Cayley graphs with soluble vertex stabilizer on finite nonabelian simple groups. We prove that all such graphs are either normal or or . Further, a connected arc-transitive pentavalent Cayley graph on is constructed. To our knowledge, this is the first known example of pentavalent 3-arc-transitive Cayley graph on finite nonabelian simple group which is non-normal.
Keywords
Cite
@article{arxiv.1702.05754,
title = {Arc-transitive pentavalent Cayley graphs with soluble vertex stabilizer on finite nonabelian simple groups},
author = {Bo Ling and Ben Gong Lou},
journal= {arXiv preprint arXiv:1702.05754},
year = {2017}
}
Comments
10 pages