Pages that link to "Item:Q3301692"
From MaRDI portal
The following pages link to Enumeration of spanning trees on Apollonian networks (Q3301692):
Displaying 7 items.
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Enumeration of spanning trees in the sequence of Dürer graphs (Q1698483) (← links)
- A general method for computing Tutte polynomials of self-similar graphs (Q2147865) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Number of spanning trees in the sequence of some graphs (Q2325140) (← links)
- Tutte polynomial of the Apollonian network (Q3301779) (← links)
