| 连通图的谱半径上界 |
| |
| 引用本文： | 周峰,黄廷祝,陈虹.连通图的谱半径上界[J].数学的实践与认识,2010,40(21). |
| |
| 作者姓名： | 周峰 黄廷祝 陈虹 |
| |
| 摘 要： | 图谱理论是图论研究的重要的领域之一.设图G是n阶简单连通图,具有n顶点和m条边的连通图,p(G)为图G的邻接矩阵的谱半径.利用代数的方法得出两个ρ(G)的上界为:■与■和达到上界的图.
|
| 关 键 词： | 图 邻接矩阵 谱半径 上界 |
Bounds of the Spectral Radius of Connected Graphs |
| |
| ZHOU Feng,HUANG Ting-zhu,CHEN Hong.Bounds of the Spectral Radius of Connected Graphs[J].Mathematics in Practice and Theory,2010,40(21). |
| |
| Authors: | ZHOU Feng HUANG Ting-zhu CHEN Hong |
| |
| Abstract: | The theory of graph spectrum is an important area in graph theory.LetGbe a simple connected with n vertices,m edges andρ(G)be the adjacency spectral radius of G. In this paper,by using algebraic techniques,this paper presents the upper bound ofρ(G):■ and ■the extreme graphs arriving the bound. |
| |
| Keywords: | graph adjacency matrix spectral radius upper bound |
| 本文献已被 万方数据 等数据库收录！ |
|
