Connectedness and Isomorphism Properties of the Zig-Zag Product of Graphs
DOI10.1002/jgt.21917zbMath1346.05244arXiv1404.4342OpenAlexW1877125464MaRDI QIDQ2825486
Alfredo Donno, Daniele D'Angeli, Ecaterina Sava-Huss
Publication date: 13 October 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.4342
connected componentzig-zag productreplacement productdouble cycle graphparity blockparity block decompositionpseudo-replacement
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Counting dimer coverings on self-similar Schreier graphs
- Amenability via random walks.
- Schreier graphs of the Basilica group.
- Zig-zag and replacement product graphs and LDPC codes
- Filling Riemannian manifolds
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Generalized wreath products of graphs and groups
- The Tutte polynomial of the Sierpiński and Hanoi graphs
- Expander graphs in pure and applied mathematics
- Expander graphs and their applications
- ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
- Partition Functions of the Ising Model on Some Self-similar Schreier Graphs
- On one-factorizations of replacement products
This page was built for publication: Connectedness and Isomorphism Properties of the Zig-Zag Product of Graphs