English

Which Haar graphs are Cayley graphs?

Group Theory 2015-05-07 v1 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1505.01475,
  title  = {Which Haar graphs are Cayley graphs?},
  author = {István Estélyi and Tomaž Pisanski},
  journal= {arXiv preprint arXiv:1505.01475},
  year   = {2015}
}

Comments

13 pages, 2 figures

R2 v1 2026-06-22T09:29:18.729Z