Vertex-transitive Haar graphs that are not Cayley graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43950939" target="_blank" >RIV/49777513:23520/18:43950939 - isvavai.cz</a>
Result on the web
<a href="https://www.springerprofessional.de/en/vertex-transitive-haar-graphs-that-are-not-cayley-graphs/15836706" target="_blank" >https://www.springerprofessional.de/en/vertex-transitive-haar-graphs-that-are-not-cayley-graphs/15836706</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-78434-2_3" target="_blank" >10.1007/978-3-319-78434-2_3</a>

Result language
angličtina
Original language name
Vertex-transitive Haar graphs that are not Cayley graphs
Original language description
In a recent paper in Electron. J. Combin. 23 (2016) Estélyi 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/LO1506" target="_blank" >LO1506: Sustainability support of the centre NTIS - New Technologies for the Information Society</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)