Sharp upper bounds on the spectral radius of graphs

By Jinlong Shu, Yarong Wu. 2004

49 citations recorded by the source corpus.

Abstract Let G be a simple connected graph with n vertices, m edges and degree sequence: d 1 ⩾ d 2 ⩾⋯⩾ d n . The spectral radius ρ ( G ) of graph G is the largest eigenvalue of its adjacency matrix. In this paper, we present some sharp upper bounds of the spectral radius in terms of the degree sequence of graphs.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/82b4ae95a6a578bf5fcb0d3861e9b4dc48f18439