ACYCLIC ORIENTATIONS ON THE SIERPINSKI GASKET
From MaRDI portal
Publication:2861306
DOI10.1142/S0217979212501287zbMath1274.28011arXiv1005.3627OpenAlexW2009632777MaRDI QIDQ2861306
Publication date: 12 November 2013
Published in: International Journal of Modern Physics B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.3627
Related Items (2)
Tutte polynomial of scale-free networks ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Spanning trees on the Sierpinski gasket
- Self-avoiding paths on the pre-Sierpinski gasket
- Dimer coverings on the Sierpinski gasket
- Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
- The exponent for the mean square displacement of self-avoiding random walk on the Sierpinski gasket
- Acyclic orientations of random graphs
- The oriented cycle game
- Sinks in acyclic orientations of graphs
- Acyclic orientations of graphs
- Activity preserving bijections between spanning trees and orientations in graphs
- Self-avoiding random walks: Some exactly soluble cases
- EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
- Hamiltonian walks on the Sierpinski gasket
This page was built for publication: ACYCLIC ORIENTATIONS ON THE SIERPINSKI GASKET