Pages that link to "Item:Q659629"
From MaRDI portal
The following pages link to The number of spanning trees in self-similar graphs (Q659629):
Displaying 20 items.
- Enumeration of matchings in families of self-similar graphs (Q608260) (← links)
- Resistance scaling and the number of spanning trees in self-similar lattices (Q633130) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- Determinant identities for Laplace matrices (Q1044622) (← links)
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs (Q1045201) (← links)
- Regularized Laplacian determinants of self-similar fractals (Q1639947) (← links)
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs (Q1672982) (← links)
- The number of spanning trees of a class of self-similar fractal models (Q1751423) (← links)
- Potts model partition functions on two families of fractal lattices (Q1783100) (← 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)
- A general method for computing Tutte polynomials of self-similar graphs (Q2147865) (← links)
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly (Q2216213) (← links)
- Enumeration problems for classes of self-similar graphs (Q2384571) (← links)
- The number of spanning trees of plane graphs with reflective symmetry (Q2568971) (← links)
- Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network (Q2669319) (← 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)
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
- A connection between discrete and regularized Laplacian determinants on fractals (Q6572808) (← links)
- The number of spanning trees for Sierpiński graphs and data center networks (Q6614885) (← links)
