Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix

2015/07/25 by Lihua You, You, Lihua, Yujie Shu +3
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.1507.07059

openalex publication_date 2015/07/25 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known results about various spectral radii, including the adjacency spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance signless Laplacian spectral radius of a graph or a digraph.

Related

• A Sharp upper bound for the spectral radius of a nonnegative matrix and applications
• Bounds on the spectral radius of nonnegative matrices and applications in graph spectra
• Some sharp bounds on the distance signless Laplacian spectral radius of graphs
• A matrix realization of spectral bounds of the spectral radius of a nonnegative matrix
• Sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor and its applications