Counting spanning trees on fractal graphs and their asymptotic complexity
From MaRDI portal
Publication:2834772
DOI10.1088/1751-8113/49/35/355101zbMath1350.05141arXiv1602.01996OpenAlexW3103256708MaRDI QIDQ2834772
Jason A. Anema, Konstantinos Tsougkas
Publication date: 24 November 2016
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.01996
Trees (05C05) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (5)
Laplacian growth and sandpiles on the Sierpiński gasket: limit shape universality and exact solutions ⋮ Regularized Laplacian determinants of self-similar fractals ⋮ SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly ⋮ Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao
This page was built for publication: Counting spanning trees on fractal graphs and their asymptotic complexity
