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

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 (H,(X Y)\1\) is equal to H: A(H,X,Y), where A(H,X,Y) is the setwise stabiliser in (H) of X Y. We use this criterion to resolve a questions of Li, Ma and Pan from 2009, by constructing a 2-arc transitive normal cover of order 253 of the complete bipartite graph 16,16 and prove that it is not a Cayley graph.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…