Spanning trees of finite Sierpiński graphs
From MaRDI portal
Publication:3575015
zbMATH Open1190.05081MaRDI QIDQ3575015FDOQ3575015
Authors: Elmar Teufl, Stephan Wagner 
Publication date: 5 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0135/0.html
Recommendations
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Cited In (22)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Spanning trees in random series-parallel graphs
- Weighted spanning trees on some self-similar graphs
- Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent
- Spanning tree generating functions and Mahler measures
- Structure of spanning trees on the two-dimensional Sierpiński gasket
- Fixed topology Steiner trees and spanning forests
- Title not available (Why is that?)
- Spanning trees of descendants of a complete graph
- Branching on a Sierpinski graph
- Counting spanning trees on fractal graphs and their asymptotic complexity
- Spanning trees on the Sierpinski gasket
- The Tutte polynomial of the Sierpiński and Hanoi graphs
- The number of spanning trees in self-similar graphs
- Communicability angle and the spatial efficiency of networks
- Number of connected spanning subgraphs on the Sierpiński gasket
- Sequences of spanning trees and a fixed tree theorem
- Contiguous search problem in Sierpiński graphs
- Title not available (Why is that?)
- The number of spanning trees in Apollonian networks
- SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
- Resistance scaling and the number of spanning trees in self-similar lattices
This page was built for publication: Spanning trees of finite Sierpiński graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575015)
