Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models'' by Ma and Yao (Q2032156): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Counting spanning trees on fractal graphs and their asymptotic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some topological structures of fractals and their related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting spanning trees in self-similar networks by evaluating determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of a class of self-similar fractal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iteration method for computing the total number of spanning trees and its applications in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The evaluation of the number and the entropy of spanning trees on generalized small-world networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration problems for classes of self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New method for counting the number of spanning trees in a two-tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in Apollonian networks / rank
 
Normal rank

Revision as of 23:55, 25 July 2024

scientific article
Language Label Description Also known as
English
Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models'' by Ma and Yao
scientific article

    Statements

    Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models'' by Ma and Yao (English)
    0 references
    0 references
    0 references
    16 June 2021
    0 references
    complex networks
    0 references
    self-similar fractals
    0 references
    data structures
    0 references
    spanning trees
    0 references
    entropy
    0 references

    Identifiers