This paper discussed the number of spanning trees in the undirected circulant graphs with odd degrees, giving an analytic eppres-sion, an asymptotic result and an effective method to calculate the numbers.
本文首先讨论度数为奇数的无向循环图的支撑树计数问题，给出其解析表达式及渐近结果，并给出一有效方法来计算支撑树数目。
参考来源 - 无向循环图与广义de Bruijn有向图的支撑树与欧拉环游的计数·2,447,543篇论文数据，部分数据来源于NoteExpress
应用推荐