The number and degree distribution of spanning trees in the Tower of Hanoi graph

DOI10.1016/j.tcs.2015.10.032zbMath1332.05036arXiv1510.07949WikidataQ57772681 ScholiaQ57772681MaRDI QIDQ897918

Shunqi Wu, Mingyun Li, Francesc Comellas, Zhong-Zhi Zhang

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07949

zbMATH Keywords

degree distribution; fractal geometry; spanning trees; Tower of Hanoi graph

Mathematics Subject Classification ID

05C05: Trees

05C85: Graph algorithms (graph-theoretic aspects)

05C07: Vertex degrees

Related Items

Dimer coverings on the Tower of Hanoi graph, A tour of general Hanoi graphs, A survey and classification of Sierpiński-type graphs, Maximum matchings in scale-free networks with identical degree distribution, The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs, The evaluation of the number and the entropy of spanning trees on generalized small-world networks, Eigenvalues of transition weight matrix for a family of weighted networks, A general method for computing Tutte polynomials of self-similar graphs, Study of dimer-monomer on the generalized Hanoi graph, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph

Cites Work

• Unnamed Item
• Farey graphs as models for complex networks
• Resistance scaling and the number of spanning trees in self-similar lattices
• The number of spanning trees in self-similar graphs
• Spanning trees: A survey
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Asymptotic fringe distributions for general families of random trees
• Spanning trees on the Sierpinski gasket
• Matrix tree theorems
• On the characterization of graphs with maximum number of spanning trees
• Chromatic number and the 2-rank of a graph
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• Enumeration problems for classes of self-similar graphs
• Counting spanning trees using modular decomposition
• The number of spanning trees in Apollonian networks
• Pfaffian orientations and perfect matchings of scale-free networks
• Counting spanning trees in self-similar networks by evaluating determinants
• The Tower of Hanoi – Myths and Maths
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Spanning trees on graphs and lattices inddimensions
• Uniform spanning trees on Sierpinski graphs
• Structure of spanning trees on the two-dimensional Sierpinski gasket
• Asymptotic Enumeration of Spanning Trees