The number of spanning trees of a class of self-similar fractal models

DOI10.1016/j.ipl.2018.04.004zbMath1476.05084OpenAlexW2796581768MaRDI QIDQ1751423

Bing Yao, Fei Ma

Publication date: 25 May 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.04.004

zbMATH Keywords

self-similaritycombinatorial problemscomplex networkspanning treesrecursive computational method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30)

Related Items (5)

On two conjectures concerning spanning tree edge dependences of graphs ⋮ Tutte polynomials of two self-similar network models ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao ⋮ Eigenvalues of transition weight matrix for a family of weighted networks

Cites Work

• Unnamed Item
• Unnamed Item
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Spanning trees on graphs and lattices inddimensions
• Deterministic scale-free networks

This page was built for publication: The number of spanning trees of a class of self-similar fractal models