-
Abstract: This paper considered the following problem: Among all the complements of unicyclic graphs with order n, which one has the maximum spectral radius? It was showed that the extremal graph is S_n^3, where S_n^3 is obtained from a 3-cycle by attaching n-3 pendant vertices to a vertex.
-
Key words:
- spectral radiusunicyclic graphcomplement /
点击查看大图
计量
- 文章访问数: 2832
- HTML全文浏览量: 18
- PDF下载量: 1251
- 被引次数: 0