Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph

Daniel R. Hawtin, Cheryl E. Praeger, Jin Xin Zhou

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

A mixed dihedral group is a group H with two disjoint subgroups X and Y, each elementary abelian of order 2n, such that H is generated by X∪Y, and H/H≅X×Y. In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph Cay(H,(X∪Y)\{1}) is equal to H⋊A(H,X,Y), where A(H, X, Y) is the setwise stabiliser in Aut(H) of X∪Y. We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order 253 of the complete bipartite graph K16,16 and prove that it is not a Cayley graph.

Original languageEnglish
Pages (from-to)561-574
Number of pages14
JournalJournal of Algebraic Combinatorics
Volume59
Issue number3
Early online date23 Feb 2024
DOIs
Publication statusPublished - May 2024

Fingerprint

Dive into the research topics of 'Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph'. Together they form a unique fingerprint.

Cite this