-
Abstract: This paper studies the tree graphs TG of G(n,n+1) simple connected graphs with n vertices and n+1 edges. The bounds, determined by n and l, on the spectral radius of TG are obtained, where l are co-edges of the two basic cycles of G(n,n+1).
-
Key words:
- tree graphbasic cyclespectral radius /
点击查看大图
计量
- 文章访问数: 3268
- HTML全文浏览量: 7
- PDF下载量: 379
- 被引次数: 0