| 图谱半径的可达上界与可达下界 |
| |
| 引用本文： | 房启明,左连翠.图谱半径的可达上界与可达下界[J].陕西理工学院学报(自然科学版),2014(6):61-66. |
| |
| 作者姓名： | 房启明 左连翠 |
| |
| 作者单位： | 天津师范大学数学科学学院,天津300387 |
| |
| 基金项目： | 国家自然科学基金青年基金资助项目（61103073） |
| |
| 摘 要： | 利用图的度序列得出了图的邻接矩阵的谱半径的一个可达上界和一个可达下界,并刻划了图谱半径达到上、下界时图的特征。
|
| 关 键 词： | 邻接矩阵 谱半径 特征值 可达上界 可达下界 |
Sharp upper and lower bounds on the spectral radius of graphs |
| |
| FANG Qi-ming,ZUO Lian-cui.Sharp upper and lower bounds on the spectral radius of graphs[J].Journal of Shananxi University of Technology:Natural Science Edition,2014(6):61-66. |
| |
| Authors: | FANG Qi-ming ZUO Lian-cui |
| |
| Institution: | (College of Mathematical Science, Tianjin Normal University, Tianjin 300387, China) |
| |
| Abstract: | The study comes up with a sharp upper bound and a sharp lower bound on the spectral radi-us of graphs and depicts the relevant features shown on the graph. |
| |
| Keywords: | adjacency matrix spectral radius eigenvalue sharp upper bound sharp lower bound |
| 本文献已被 维普 等数据库收录！ |
