On groups all of whose Haar graphs are Cayley graphs
Yan-Quan Feng, Istvan Kovacs, Da-Wei Yang

TL;DR
This paper characterizes finite inner abelian groups for which all Haar graphs are Cayley graphs, showing only specific dihedral and quaternion groups qualify, and demonstrates that non-solvable groups have Haar graphs that are not Cayley graphs.
Contribution
It identifies the exact finite inner abelian groups with the property that all their Haar graphs are Cayley graphs, and highlights a distinction for non-solvable groups.
Findings
D6, D8, D10, and Q8 are the only such groups.
Non-solvable groups have Haar graphs that are not Cayley graphs.
Provides a characterization linking Haar graphs and Cayley graphs for specific groups.
Abstract
A Cayley graph of a group is a finite simple graph such that contains a subgroup isomorphic to acting regularly on , while a Haar graph of is a finite simple bipartite graph such that contains a subgroup isomorphic to acting semiregularly on and the -orbits are equal to the bipartite sets of . A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that the groups and are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs (a group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian). As an application, it is also shown that every non-solvable group has a Haar graph which is not a Cayley…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
