| 关于树的谱半径的一个注记 |
| |
| 引用本文： | 张建斌,周波.关于树的谱半径的一个注记[J].数学研究,2011,44(2):160-169. |
| |
| 作者姓名： | 张建斌 周波 |
| |
| 作者单位： | 华南师范大学数学科学学院,广东广州,510631 |
| |
| 基金项目： | Supported by the Natural Science Foundation of China(11001089); the Foundation for Distinguished Young Talents in Higher Education of Guangdong,China((2009)400) |
| |
| 摘 要： | 图的邻接矩阵的最大特征值称为图的谱半径．对于n≥8，1≤k≤n＋23，本文确定了n个顶点和至少有惫个顶点度不少于3的树中具有谱半径最大的树．
|
| 关 键 词： | 谱半径 特征值 特征多项式 树． |
A Note on Spectral Radius of Trees |
| |
| Zhang Jianbin,Zhou Bo.A Note on Spectral Radius of Trees[J].Journal of Mathematical Study,2011,44(2):160-169. |
| |
| Authors: | Zhang Jianbin Zhou Bo |
| |
| Institution: | Zhang Jianbin Zhou Bo (School of Mathematical Sciences,South China Normal University,Guangdong Guangzhou 510631) |
| |
| Abstract: | The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. We determine the trees with maximum spectral radius in class of trees on n vertices with at least k vertices of degree greater than two for 1 ≤ k≤n＋2/3 and n≥ 8. |
| |
| Keywords: | Spectral radius Eigenvalue Characteristic polynomial Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
