8 citations · 13 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2016★ 8 cited
Counting spanning trees on fractal graphs and their asymptotic complexity
Jason A. Anema, Konstantinos Tsougkas
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to…
math.CO2015
Lower bound of the asymptotic complexity of self-similar fractal graphs
Konstantinos Tsougkas
We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal . We show how full…