pith. sign in

arxiv: 1603.05851 · v1 · pith:6F3GPBYCnew · submitted 2016-03-18 · 🧮 math.GR · math.CO

Vertex-transitive Haar graphs that are not Cayley graphs

classification 🧮 math.GR math.CO
keywords graphshaarvertex-transitivecayleygraphtrivalentarxivcensus
0
0 comments X
read the original abstract

In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley. The smallest example has 40 vertices and is the well-known Kronecker cover over the dodecahedron graph $G(10,2)$, occurring as the graph $40$ in the Foster census of connected symmetric trivalent graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.