Pages that link to "Item:Q1751423"
From MaRDI portal
The following pages link to The number of spanning trees of a class of self-similar fractal models (Q1751423):
Displaying 11 items.
- An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071) (← links)
- Tutte polynomials of two self-similar network models (Q1731015) (← links)
- The evaluation of the number and the entropy of spanning trees on generalized small-world networks (Q1741668) (← links)
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes (Q1780980) (← links)
- 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) (← links)
- Eigenvalues of transition weight matrix for a family of weighted networks (Q2111824) (← links)
- The maximum number of spanning trees of a graph with given matching number (Q2239004) (← links)
- Counting spanning trees on fractal graphs and their asymptotic complexity (Q2834772) (← links)
- Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)
- The structural properties and the spanning trees entropy of the generalized Fractal Scale-Free Lattice (Q4958798) (← links)
- On two conjectures concerning spanning tree edge dependences of graphs (Q6180563) (← links)
