158 research outputs found
A formula for the number of spanning trees in circulant graphs with non-fixed generators and discrete tori
We consider the number of spanning trees in circulant graphs of
vertices with generators depending linearly on . The matrix tree theorem
gives a closed formula of factors, while we derive a formula of
factors. Using the same trick, we also derive a formula for the
number of spanning trees in discrete tori. Moreover, the spanning tree entropy
of circulant graphs with fixed and non-fixed generators is compared.Comment: 8 pages, 2 figure
- …