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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.