The number of spanning trees in self-similar graphs

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

zbMATH Keywords

spanning treesself-similar graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Boundary value problems on graphs and networks for ordinary differential equations (34B45)

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

Cites work

• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• scientific article; zbMATH DE number 1223660 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A trace on fractal graphs and the Ihara zeta function
• Analysis on fractals
• Asymptotic Enumeration of Spanning Trees
• Enumeration problems for classes of self-similar graphs
• Growth of Self‐Similar Graphs
• On eigenvalue problems for Laplacians on p.c.f. self-similar sets
• Random walks on infinite self-similar graphs
• Some determinant expansions and the matrix-tree theorem
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• Spanning trees of finite Sierpiński graphs
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on the Sierpinski gasket
• Spectral properties of self-similar lattices and iteration of rational maps
• The short-cut test

Cited in

(25)

• Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network
• Abelian sandpiles on Sierpiński gasket graphs
• The number of spanning trees of a class of self-similar fractal models
• Enumeration problems for classes of self-similar graphs
• A general method for computing Tutte polynomials of self-similar 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
• Potts model partition functions on two families of fractal lattices
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• The number of spanning trees for Sierpiński graphs and data center networks
• Regularized Laplacian determinants of self-similar fractals
• Counting spanning trees in self-similar networks by evaluating determinants
• Resistance scaling and the number of spanning trees in self-similar lattices
• Counting spanning trees on fractal graphs and their asymptotic complexity
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• Enumeration of matchings in families of self-similar graphs
• Exact and asymptotic enumeration of perfect matchings in self-similar graphs
• Counting spanning trees in prism and anti-prism graphs
• Spanning trees of finite Sierpiński graphs
• Determinant identities for Laplace matrices
• The number of spanning trees of plane graphs with reflective symmetry
• Weighted spanning trees on some self-similar graphs
• Number of spanning trees in the sequence of some graphs
• Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly
• Asymptotic enumeration on self-similar graphs with two boundary vertices
• A connection between discrete and regularized Laplacian determinants on fractals

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)