We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We consider the number of spanning trees in circulant graphs of 
${\it\beta}n$ vertices with generators depending linearly on 
$n$. The matrix tree theorem gives a closed formula of 
${\it\beta}n$ factors, while we derive a formula of 
${\it\beta}-1$ factors. We also derive a formula for the number of spanning trees in discrete tori. Finally, we compare the spanning tree entropy of circulant graphs with fixed and nonfixed generators.
