Which Haar graphs are Cayley graphs?

Abstract

For a finite group G and subset S of G, the Haar graph H(G,S) is a bipartite regular graph, defined as a regular G-cover of a dipole with |S| parallel arcs labelled by elements of S. If G is an abelian group, then H(G,S) is well-known to be a Cayley graph; however, there are examples of non-abelian groups G and subsets S when this is not the case. In this paper we address the problem of classifying finite non-abelian groups G with the property that every Haar graph H(G,S) is a Cayley graph. An equivalent condition for H(G,S) to be a Cayley graph of a group containing G is derived in terms of G, S and Aut G. It is also shown that the dihedral groups, which are solutions to the above problem, are Z22,D3,D4 and D5.

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…