Pages that link to "Item:Q2384571"
From MaRDI portal
The following pages link to Enumeration problems for classes of self-similar graphs (Q2384571):
Displaying 16 items.
- Copy-paste trees and their growth rates (Q315386) (← links)
- Counting dimer coverings on self-similar Schreier graphs (Q444407) (← links)
- 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 of spanning trees in self-similar graphs (Q659629) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- An asymptotic independence theorem for the number of matchings in graphs (Q1043805) (← links)
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs (Q1045201) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← 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)
- K-Narayana sequence self-similarity. Flip graph views of k-Narayana self-similarity (Q2169362) (← links)
- Using edge generating function to solve monomer-dimer problem (Q2221757) (← links)
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats (Q2463473) (← links)
- The Tutte polynomial of a class of compound graphs and its applications (Q6174137) (← links)
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket (Q6564418) (← links)
- A connection between discrete and regularized Laplacian determinants on fractals (Q6572808) (← links)
