Sharp bounds for the spectral radius of nonnegative matrices
From MaRDI portal
Abstract: We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices associated with a graph, including the adjacency matrix, the signless Laplacian matrix, the distance matrix, the distance signless Laplacian matrix, and the reciprocal distance matrix.
Recommendations
- Sharp bounds on the spectral radius of a nonnegative matrix
- On sharp bounds for spectral radius of nonnegative matrices
- Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
- Some new sharp bounds for the spectral radius of a nonnegative matrix and its application
- Bounds on the spectral radius of a nonnegative matrix and its applications
Cites work
- A note on Laplacian graph eigenvalues
- A sharp upper bound of the spectral radius of graphs
- Bounds and conjectures for the signless Laplacian index of graphs
- Bounds on eigenvalues and chromatic numbers
- Distance matrix polynomials of trees
- Graph-theoretical matrices in chemistry
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1737277 (Why is no real title available?)
- Matrix Analysis
- Sharp bounds on the signless Laplacian spectral radii of graphs
- Sharp bounds on the spectral radius of a nonnegative matrix
- Sharp upper bounds on the spectral radius of graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Signless Laplacians of finite graphs
- Spectral radius and average 2-degree sequence of a graph
- Spectral radius and degree sequence of a graph
- Spectral radius of non-negative matrices and digraphs
- The largest eigenvalue of a graph: A survey
- Two Laplacians for the distance matrix of a graph
- Two sharp upper bounds for the signless Laplacian spectral radius of graphs
- Upper and lower bounds for the Perron root of a nonnegative matrix
Cited in
(23)- Tight bounds on the spectral radius of asymmetric nonnegative matrices
- An extending result on spectral radius of bipartite graphs
- Some new bounds on the spectral radius of nonnegative matrices
- A general result on the spectral radii of nonnegative \(k\)-uniform tensors
- Bounds for the spectral radius of nonnegative matrices and generalized Fibonacci matrices
- Distance spectra of graphs: a survey
- On the distance Laplacian spectral radius of graphs
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- Some new sharp bounds for the spectral radius of a nonnegative matrix and its application
- Sharp upper bounds on the distance spectral radius of a graph
- Sharp bounds on the spectral radius of a nonnegative matrix
- Sequences of lower and upper bounds for the spectral radius of a nonnegative matrix
- A sharp upper bound for the spectral radius of a nonnegative matrix and applications.
- Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
- Bounds for spectral radius of various matrices associated with graphs
- scientific article; zbMATH DE number 1248185 (Why is no real title available?)
- On sharp bounds for spectral radius of nonnegative matrices
- Bounds via spectral radius-preserving row sum expansions
- Sharp bounds for the spectral radii of nonnegative tensors
- Bounds on the spectral radius of a nonnegative matrix and its applications
- Distance signless Laplacian spectra of graphs: a survey
- Upper bounds for eigenvalues of symmetric substochastic matrices and applications
- Assessing the Perron-Frobenius root of symmetric positive semidefinite matrices by the adaptive steepest descent method
This page was built for publication: Sharp bounds for the spectral radius of nonnegative matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447970)