22 citations · 69 across the 8 of their papers we have counts for
1 paper · 2 filters
Stefan Boettcher, Shanshan Li
We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees…