Up to a double cover, every regular connected graph is isomorphic to a Schreier graph
From MaRDI portal
Publication:2135300
DOI10.36045/j.bbms.210416zbMath1487.05118arXiv2010.06431MaRDI QIDQ2135300
Publication date: 6 May 2022
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.06431
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Every connected regular graph of even degree is a Schreier coset graph
- Infinite digraphs with given regular automorphism groups
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Schreir graphs: Transitivity and coverings
- The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps
- On a Class of Fixed-Point-Free Graphs
- König's Duality Theorem for Infinite Bipartite Graphs
This page was built for publication: Up to a double cover, every regular connected graph is isomorphic to a Schreier graph
