The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

Alexander Mednykh, Ilya Mednykh

In this paper, we develop a new method to produce explicit formulas for the number $\tau (n)$ of spanning trees in the undirected circulant graphs $C_n(s_1,s_2,\dots ,s_k)$ and $C_{2…