Using mixed dihedral groups to construct normal Cayley graphs, and a new bipartite $2$-arc-transitive graph which is not a Cayley graph
Combinatorics
2023-04-24 v1
Abstract
A \emph{mixed dihedral group} is a group with two disjoint subgroups and , each elementary abelian of order , such that is generated by , and . In this paper we give a sufficient condition such that the automorphism group of the Cayley graph is equal to , where is the setwise stabiliser in of . We use this criterion to resolve a questions of Li, Ma and Pan from 2009, by constructing a -arc transitive normal cover of order of the complete bipartite graph and prove that it is \emph{not} a Cayley graph.
Keywords
Cite
@article{arxiv.2304.10633,
title = {Using mixed dihedral groups to construct normal Cayley graphs, and a new bipartite $2$-arc-transitive graph which is not a Cayley graph},
author = {Daniel R. Hawtin and Cheryl E. Praeger and Jin-Xin Zhou},
journal= {arXiv preprint arXiv:2304.10633},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2303.00305, arXiv:2211.16809