Pages that link to "Item:Q1045201"
From MaRDI portal
The following pages link to Exact and asymptotic enumeration of perfect matchings in self-similar graphs (Q1045201):
Displayed 4 items.
- Counting dimer coverings on self-similar Schreier graphs (Q444407) (← links)
- Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Connectivity and some other properties of generalized Sierpiński graphs (Q5155718) (← links)