The number of spanning trees in self-similar graphs
From MaRDI portal
Publication:659629
DOI10.1007/S00026-011-0100-YzbMATH Open1234.05123OpenAlexW2115821419MaRDI QIDQ659629FDOQ659629
Authors: Elmar Teufl, Stephan Wagner 
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-011-0100-y
Recommendations
- scientific article; zbMATH DE number 5584928
- The number of spanning trees in some classes of graphs
- The number of spanning tree in several classes of graphs
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- The number of spanning trees of a graph
- The number of spanning trees of a graph
- Counting spanning trees in self-similar networks by evaluating determinants
- scientific article; zbMATH DE number 5497806
- The number of spanning trees in circulant graphs
- Counting the number of spanning trees of graphs
Trees (05C05) Enumeration in graph theory (05C30) Boundary value problems on graphs and networks for ordinary differential equations (34B45)
Cites Work
- Title not available (Why is that?)
- Spanning trees of finite Sierpiński graphs
- Asymptotic Enumeration of Spanning Trees
- Analysis on fractals
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Title not available (Why is that?)
- Some determinant expansions and the matrix-tree theorem
- Spanning trees on graphs and lattices inddimensions
- Spanning trees on the Sierpinski gasket
- Enumeration problems for classes of self-similar graphs
- Spectral properties of self-similar lattices and iteration of rational maps
- Title not available (Why is that?)
- On eigenvalue problems for Laplacians on p.c.f. self-similar sets
- A trace on fractal graphs and the Ihara zeta function
- The short-cut test
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
- Random walks on infinite self-similar graphs
- Growth of Self‐Similar Graphs
Cited In (21)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Weighted spanning trees on some self-similar graphs
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly
- A connection between discrete and regularized Laplacian determinants on fractals
- Regularized Laplacian determinants of self-similar fractals
- A general method for computing Tutte polynomials of self-similar graphs
- Asymptotic enumeration on self-similar graphs with two boundary vertices
- Spanning trees of finite Sierpiński graphs
- Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao
- Enumeration of matchings in families of self-similar graphs
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- The number of spanning trees for Sierpiński graphs and data center networks
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- Determinant identities for Laplace matrices
- Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network
- Potts model partition functions on two families of fractal lattices
- Abelian sandpiles on Sierpiński gasket graphs
- Enumeration problems for classes of self-similar graphs
- Counting spanning trees in self-similar networks by evaluating determinants
- Resistance scaling and the number of spanning trees in self-similar lattices
- The number of spanning trees of plane graphs with reflective symmetry
This page was built for publication: The number of spanning trees in self-similar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659629)
