Open Access
2007 SOME SHARP UPPER BOUNDS ON THE SPECTRAL RADIUS OF GRAPHS
Lihua Feng, Qiao Li, Xiao-Dong Zhang
Taiwanese J. Math. 11(4): 989-997 (2007). DOI: 10.11650/twjm/1500404797

Abstract

In this paper, we first give a relation between the adjacency spectral radius and the $Q$-spectral radius of a graph. Then using this result, we further give some new sharp upper bounds on the adjacency spectral radius of a graph in terms of degrees and the average 2-degrees of vertices. Some known results are also obtained.

Citation

Download Citation

Lihua Feng. Qiao Li. Xiao-Dong Zhang. "SOME SHARP UPPER BOUNDS ON THE SPECTRAL RADIUS OF GRAPHS." Taiwanese J. Math. 11 (4) 989 - 997, 2007. https://doi.org/10.11650/twjm/1500404797

Information

Published: 2007
First available in Project Euclid: 18 July 2017

zbMATH: 1155.05043
MathSciNet: MR2348546
Digital Object Identifier: 10.11650/twjm/1500404797

Subjects:
Primary: 05C50

Keywords: $Q$-matrix , ‎adjacency matrix , Line graph , spectral radius

Rights: Copyright © 2007 The Mathematical Society of the Republic of China

Vol.11 • No. 4 • 2007
Back to Top