On the spectral radius, k-degree and the upper bound of energy in a graph
On the spectral radius, k-degree and the upper bound of energy in a graph
复制标题
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Hou Yao-ping;Tang Zhen;Woo Chingwah
中科院分区：
文献类型：
--
作者：
Hou Yao-ping;Tang Zhen;Woo Chingwah
设G是一个简单图。设v ∈ V（G），v的k度dk（v）是G从v开始的长度为k的路的个数.本文给出了G的谱半径的一个由顶点k度表示的下界，并得到了连通图的能量的一个上界.
Let G be a simple graph. For v ∈ V (G), k-degree dk(v) of v is the number of walks of length k of G starting at v. In this paper a lower bounds of the spectral radius of G in terms of the k-degree of vertices is presented and the upper bounds of energy of a connected graph is obtained.