Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory
From MaRDI portal
(Redirected from Publication:2451220)
Recommendations
Cites work
- Chromatic number and spectral radius
- Eigenvalue bounds and inequalities using vector aggregation of matrices
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- On the extreme eigenvalues of block \(2\times 2\) Hermitian matrices
- Rayleigh-Ritz and A. Weinstein Methods for Approximation of Eigenvalues
Cited in
(16)- More tales of Hoffman: bounds for the vector chromatic number of a graph
- The \(A_\alpha\)-spread of a graph
- Spectral lower bounds for the orthogonal and projective ranks of a graph
- Spectral lower bounds for the quantum chromatic number of a graph
- On the extreme eigenvalues of block \(2\times 2\) Hermitian matrices
- A conjecture about the inertia of Hermitian matrices
- Some applications of a majorization inequality due to Bapat and Sunder
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- An inertial lower bound for the chromatic number of a graph
- Hoffman-Wielandt type inequality for block companion matrices of certain matrix polynomials
- Spectral bounds for the quantum chromatic number of quantum graphs
- Proof of a conjectured lower bound on the chromatic number of a graph
- Unified spectral bounds on the chromatic number
- Bounds for the extreme eigenvalues of block \(2 \times 2\) Hermitian matrices
- Graphs and Hermitian matrices: Exact interlacing
- Chromatic number and spectral radius
This page was built for publication: Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451220)
