Spanning trees on the Sierpinski gasket
arXiv:cond-mat/0609453 · doi:10.1007/s10955-006-9262-0
Abstract
We obtain the numbers of spanning trees on the Sierpinski gasket with dimension equal to two, three and four. The general expression for the number of spanning trees on with arbitrary is conjectured. The numbers of spanning trees on the generalized Sierpinski gasket with and are also obtained.
20 pages, 8 figures, 1 table
References in corpus (7)
- Spanning Trees on Graphs and Lattices in d Dimensions
- Distribution of sizes of erased loops for loop-erased random walks
- Some Exact Results for Spanning Trees on Lattices
- Sandpiles on the Sierpinski gasket
- Spanning Trees on Lattices and Integration Identities
- High-Precision Entropy Values for Spanning Trees in Lattices
- Branched Polymers on the Given-Mandelbrot family of fractals
Cited by in corpus (32)
- Enumeration of spanning trees in a pseudofractal scale-free web
- Counting spanning trees in a small-world Farey graph
- Counting spanning trees in self-similar networks by evaluating determinants
- The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
- Dimer-monomer model on the Sierpinski gasket
- -Plane Zeros of the Potts Partition Function on Diamond Hierarchical Graphs
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
- Zeros of the Potts Model Partition Function on Sierpinski Graphs
- Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks
- Counting spanning trees on fractal graphs and their asymptotic complexity
- Regularized Laplacian determinants of self-similar fractals
- On complexity of cyclic coverings of graphs
- Tutte polynomial of pseudofractal scale-free web
- Acyclic orientations on the Sierpinski gasket
- Counting Spanning Trees on Fractal Graphs
- Average trapping time on a type of horizontally segmented 3 dimensional Sierpinski gasket network with two types of locally self-similar structures
- Uniform spanning trees on Sierpinski graphs
- Ice model and eight-vertex model on the two-dimensional Sierpinski gasket
- On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: Solving the Hofstadter-Sierpinski butterfly
- Average Trapping time on the 3-dimensional 3-level Sierpinski gasket network with a set of trap nodes
- Potts Partition Function Zeros and Ground State Entropy on Hanoi Graphs
- The Abelian Sandpile Model on Fractal Graphs
- Spanning forests on the Sierpinski gasket
- The localization of quantum random walks on sierpinski gaskets
- Universality and exact finite-size corrections for spanning trees on cobweb and fan networks
- On Jacobian group and complexity of the Y-graph
- Lower bound of the asymptotic complexity of self-similar fractal graphs
- Number of connected spanning subgraphs on the Sierpinski gasket
- The Number of Spanning Trees in Apollonian Networks
- Structure of spanning trees on the two-dimensional Sierpinski gasket