An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deterministic scale-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in Apollonian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees on various lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on the Sierpinski gasket / 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: Geometry of minimum spanning trees on scale-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop-erased random walks, spanning trees and Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on graphs and lattices in<i>d</i>dimensions / 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: Enumeration of spanning trees in planar unclustered networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the normalized Laplacian of iterated triangulations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The normalized Laplacian spectrum of subdivisions of a graph / 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: On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs / rank
 
Normal rank

Latest revision as of 21:54, 14 July 2024

scientific article
Language Label Description Also known as
English
An iteration method for computing the total number of spanning trees and its applications in graph theory
scientific article

    Statements

    An iteration method for computing the total number of spanning trees and its applications in graph theory (English)
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Brouwer's fixed-point theorem
    0 references
    algorithms
    0 references
    Cayley's theorem
    0 references
    number of spanning trees
    0 references
    ladder graph
    0 references
    wheel graph
    0 references
    0 references