English

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 HH with two disjoint subgroups XX and YY, each elementary abelian of order 2n2^n, such that HH is generated by XYX\cup Y, and H/HX×YH/H'\cong X\times Y. In this paper we give a sufficient condition such that the automorphism group of the Cayley graph \Cay(H,(XY){1})\Cay(H,(X\cup Y)\setminus\{1\}) is equal to H:A(H,X,Y)H: A(H,X,Y), where A(H,X,Y)A(H,X,Y) is the setwise stabiliser in \Aut(H)\Aut(H) of XYX\cup Y. We use this criterion to resolve a questions of Li, Ma and Pan from 2009, by constructing a 22-arc transitive normal cover of order 2532^{53} of the complete bipartite graph \K16,16\K_{16,16} 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