摘要
生成树的个数是评估图(网络)可靠性的一个重要且被广泛研究的量.一般的图还无简单有效的算法计算生成树的个数,利用切比雪夫多项式的性质推出了步数可变循环图中生成树计数的在线性时间内即可实现的算法,并应用于具体的图中.
The number of spanning trees in a graph（network） is an important, well-studied quantity. No simple and efficient methods can count the number of spanning trees in general graphs. By means of the properties of Chebyshev polynomials, an algorithm running in linear time is derived for non-fixed step circulant graphs and can be applied to specific graphs.
出处
《甘肃科学学报》
2007年第2期1-4,共4页
Journal of Gansu Sciences
基金
甘肃省自然科学基金(3SZ051-A25-037)
