科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the number of spanning trees in circulant graphs of beta n vertices with generators depending linearly on n. The matrix tree theorem gives a closed formula of beta n factors, while we derive a formula of 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.
- 出版日期2015-12
