摘要
文章通过研究双星图的代数连通度的极限点 ,给出树的代数连通度的极限点的分布范围 :[0,(3- 5)/2] ,以及分布情况的一个结论 : ε>0 ,至少存在一个树类 ,其代数连通度的极限为r>0 ,且r<ε。
By doing some research on the limits of algebraic connectivity of double-star graphs,we give the distribution range of the limits of algebraic connectivity of tree:[0,(3- 5 )/2],and a conclusion of concerned distribution is:for any,there is at least a class of trees,whose limits of algebraic connectivity are,and0<r<ε.
关键词
树
代数连通度
极限点
tree
algebraic connectivity
limit