Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
From MaRDI portal
Publication:2961455
DOI10.1080/03081087.2016.1168355zbMath1356.05084arXiv1507.07059OpenAlexW2318654273MaRDI QIDQ2961455
Yujie Shu, Lihua You, Pingzhi Yuan
Publication date: 20 February 2017
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07059
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Improved global algorithms for maximal eigenpair ⋮ Bounds on the spectral radius of a nonnegative matrix and its applications ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity ⋮ Sharp bounds for spectral radius of nonnegative weakly irreducible tensors
Cites Work
- Further results on the spectral radius of matrices and graphs
- Two Laplacians for the distance matrix of a graph
- Sharp bounds on the signless Laplacian spectral radii of graphs
- Bounds on the index of the signless Laplacian of a graph
- Sharp bounds for the spectral radius of digraphs
- Sharp upper bounds on the spectral radius of graphs
- Some new bounds on the spectral radius of graphs
- Maximizing the sum of the squares of the degrees of a graph
- Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
- A sharp upper bound on the signless Laplacian spectral radius of graphs
- The distance spectral radius of digraphs
- Sharp bounds for the spectral radius of nonnegative matrices
- TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS
- Upper and lower bounds for the Perron root of a nonnegative matrix
This page was built for publication: Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
