Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao

DOI10.1016/j.ipl.2021.106117OpenAlexW3146667053MaRDI QIDQ2032156

Ahmed Elsaid, Abd El Fattah A. El Atik, Abdallah W. Aboutahoun

Publication date: 16 June 2021

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

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

zbMATH Keywords

entropydata structuresself-similar fractalscomplex networksspanning trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The number of spanning trees in self-similar graphs
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• New method for counting the number of spanning trees in a two-tree network
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• The evaluation of the number and the entropy of spanning trees on generalized small-world networks
• The number of spanning trees of a class of self-similar fractal models
• A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
• Enumeration problems for classes of self-similar graphs
• The number of spanning trees in Apollonian networks
• Counting spanning trees on fractal graphs and their asymptotic complexity
• Counting spanning trees in self-similar networks by evaluating determinants
• Asymptotic Enumeration of Spanning Trees
• Some topological structures of fractals and their related graphs

This page was built for publication: Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao