Which Haar graphs are Cayley graphs?
Group Theory
2015-05-07 v1 Combinatorics
Abstract
For a finite group and subset of the Haar graph is a bipartite regular graph, defined as a regular -cover of a dipole with parallel arcs labelled by elements of . If is an abelian group, then is well-known to be a Cayley graph; however, there are examples of non-abelian groups and subsets when this is not the case. In this paper we address the problem of classifying finite non-abelian groups with the property that every Haar graph is a Cayley graph. An equivalent condition for to be a Cayley graph of a group containing is derived in terms of and . It is also shown that the dihedral groups, which are solutions to the above problem, are and .
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