| 谱半径前五位的$n$阶拟树图 |
| |
| 引用本文： | 罗可,林震,郭曙光.谱半径前五位的$n$阶拟树图[J].数学研究及应用,2018,38(2):121-129. |
| |
| 作者姓名： | 罗可 林震 郭曙光 |
| |
| 作者单位： | 青海师范大学数学系, 青海 西宁 810008; 盐城师范学院数学与统计学院, 江苏 盐城 224002,青海师范大学数学系, 青海 西宁 810008; 盐城师范学院数学与统计学院, 江苏 盐城 224002,盐城师范学院数学与统计学院, 江苏 盐城 224002 |
| |
| 基金项目： | 国家自然科学基金(Grant No.11171290),江苏省自然科学基金(Grant No.BK20151295). |
| |
| 摘 要： | A connected graph G =(V, E) is called a quasi-tree graph, if there exists a vertex v_0 ∈ 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.
|
| 关 键 词： | 拟树图 谱半径 极图 |
| 收稿时间： | 2017/4/20 0:00:00 |
| 修稿时间： | 2017/5/17 0:00:00 |
Ordering Quasi-Tree Graphs on $n$ Vertices by Their Spectral Radii |
| |
| Ke LUO,Zhen LIN and Shuguang GUO.Ordering Quasi-Tree Graphs on $n$ Vertices by Their Spectral Radii[J].Journal of Mathematical Research with Applications,2018,38(2):121-129. |
| |
| Authors: | Ke LUO Zhen LIN and Shuguang GUO |
| |
| Institution: | Department of Mathematics, Qinghai Normal University, Qinghai 810008, P. R. China; School of Mathematics and Statistics, Yancheng Teachers University, Jiangsu 224002, P. R. China,Department of Mathematics, Qinghai Normal University, Qinghai 810008, P. R. China; School of Mathematics and Statistics, Yancheng Teachers University, Jiangsu 224002, P. R. China and School of Mathematics and Statistics, Yancheng Teachers University, Jiangsu 224002, P. R. China |
| |
| Abstract: | 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. |
| |
| Keywords: | quasi-tree graph spectral radius extremal graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
|
