Spanning trees in directed circulant graphs and cycle power graphs

Abstract

The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of $\lceil \beta /2\rceil -1$ terms.

11 pages, 2 figures. Published in Monatshefte für Mathematik

References in corpus (1)

• Asymptotics for the number of spanning trees in circulant graphs and degenerating d-dimensional discrete tori