摘要
生成树的个数是评估图(网络)可靠性的一个重要且被广泛研究的量．利用切比雪夫多项式的性质推出了循环图中计算生成树个数的在线性时间内即可实现的方法,并讨论了渐进特性．
The number of spanning trees in a Through the use of the properties of Chebyshev graph （network） is an important, well-studied quantity. polynomials, simple and running-in-linear-time methods to count the spanning trees for circulant graphs were given, and asymptotic properties were discussed.
出处
《兰州大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第3期114-117,共4页
Journal of Lanzhou University(Natural Sciences)
基金
甘肃省自然科学基金资助项目(3SZ051-A25-037).
