-
摘要: G为n阶的2-树, 首先应用边移接变形的方法得到关于图G谱半径的一个判定定理, 又通过比较一些图的特征多项式, 刻画出该图类的谱半径达到第四大和第五大的极图.Abstract: Let G be a 2-tree with n vertices. By applying the technique of edge moving transformation, we first obtained a decidable theorem about the spectral radius of G. Then through comparing the characteristic polynomials of some graphs, the extremal graphs which have the fourth and fifth largest spectralradii of this kind of graphs were determined.
-
Key words:
- 2-treesspectral radiusPerron vector /
点击查看大图
计量
- 文章访问数: 2590
- HTML全文浏览量: 12
- PDF下载量: 1367
- 被引次数: 0