Every connected regular graph of even degree is a Schreier coset graph
From MaRDI portal
Publication:1243737
DOI10.1016/0095-8956(77)90068-5zbMath0369.05042OpenAlexW2003576269MaRDI QIDQ1243737
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90068-5
Related Items
A contribution to the theory of voltage graphs, Quantum ergodicity on regular graphs, Abelian factors in 2-step nilpotent Lie algebras constructed from graphs, Up to a double cover, every regular connected graph is isomorphic to a Schreier graph, Cayley, Marty and Schreier hypergraphs, Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\), The Number of Groups of a given Genus, Cayley cages, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Finite common coverings of pairs of regular graphs, Convergence towards the end space for random walks on Schreier graphs, Expander graphs and their applications, Finite common coverings of graphs, Algebraic specification of interconnection network relationships by permutation voltage graph mappings, A note on coset graphs, On groups and simplicial complexes, Generating all graph coverings by permutation voltage assignments, An average John theorem, Genus distributions for bouquets of circles, Kesten’s theorem for uniformly recurrent subgroups, On the structure of asymptotic expanders, The average genus for bouquets of circles and dipoles, Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks, Quotients of connected regular graphs of even degree, Property FW and wreath products of groups: a simple approach using Schreier graphs
Cites Work
