The spectral radius of irregular graphs
The spectral radius of irregular graphs
复制标题
不规则图的谱半径
DOI:
10.1016/j.laa.2009.02.023
复制
发表时间:
2009-07
影响因子:
1.1
通讯作者:
Shi, Lingsheng
中科院分区:
文献类型:
--
作者:
Shi, Lingsheng
Let λ1be the largest eigenvalue and λnthe least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree Δ, minimum degree δ and average degree d, thenThe inequality improves previous bounds of various authors and implies two lower bounds on λnwhich improve previous bounds of Nikiforov. It also gives some fine tuning of a result of Alon and Sudakov. A similar inequality is also obtained for the Laplacian spectral radius of a connected irregular graph.
登录
查看更多内容
DOI:
10.1016/j.jctb.2003.12.002
发表时间:
2004-05
期刊:
J. Comb. Theory B
影响因子:
--
作者:
D. Stevanović
通讯作者:
D. Stevanović
影响因子:
1.6
作者:
Trevisan, Luca
通讯作者:
Trevisan, Luca
DOI:
10.1016/j.jctb.2007.02.008
发表时间:
2007-11
期刊:
J. Comb. Theory B
影响因子:
--
作者:
Bolian Liu;Jian Shen;Xinmao Wang
通讯作者:
Bolian Liu;Jian Shen;Xinmao Wang
DOI:
10.1145/1536414.1536452
发表时间:
2008-06
期刊:
SIAM J. Comput.
影响因子:
--
作者:
L. Trevisan
通讯作者:
L. Trevisan
DOI:
10.37236/1021
发表时间:
2007-05
期刊:
Electron. J. Comb.
影响因子:
--
作者:
V. Nikiforov
通讯作者:
V. Nikiforov