| 罗可,林震,郭曙光.谱半径前五位的$n$阶拟树图[J].数学研究及应用,2018,38(2):121~129 |
| 谱半径前五位的$n$阶拟树图 |
| Ordering Quasi-Tree Graphs on $n$ Vertices by Their Spectral Radii |
| 投稿时间：2017-04-20 修订日期：2017-05-17 |
| DOI：10.3770/j.issn:2095-2651.2018.02.002 |
| 中文关键词: 拟树图 谱半径 极图 |
| 英文关键词:quasi-tree graph spectral radius extremal graph |
| 基金项目:国家自然科学基金(Grant No.11171290),江苏省自然科学基金(Grant No.BK20151295). |
|
| 摘要点击次数: 1748 |
| 全文下载次数: 1693 |
| 中文摘要: |
| 若连通图$G$中存在一个顶点$v_0$使得$G-v_0$是一棵树, 那么称$G$为拟树图. 刘慧清和陆玫在文[Linear Algebra Appl. 428 (2008) 2708-2714]中确定了谱半径最大的$n$阶拟树图. 本文拓展她们的结果, 给出谱半径第二到第五大的$n$阶拟树图. |
| 英文摘要: |
| A connected graph $G=(V,E)$ is called a quasi-tree graph, if there exists a vertex $v_0\in V(G)$ such that $G-v_0$ is a tree. Liu and Lu [Linear Algebra Appl. 428 (2008) 2708-2714] determined the maximal spectral radius together with the corresponding graph among all quasi-tree graphs on $n$ vertices. In this paper, we extend their result, and determine the second to the fifth largest spectral radii together with the corresponding graphs among all quasi-tree graphs on $n$ vertices. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
