On finite subnormal Cayley graphs
Combinatorics
2021-01-13 v1
Abstract
In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph with prime. Then we obtain a generic method for constructing half-symmetric (namely edge transitive but not arc transitive) Cayley graphs.
Keywords
Cite
@article{arxiv.2101.04313,
title = {On finite subnormal Cayley graphs},
author = {Shu Jiao Song},
journal= {arXiv preprint arXiv:2101.04313},
year = {2021}
}
Comments
9 pages