The sum of the \(k\) largest distance eigenvalues of graphs
From MaRDI portal
Publication:6080154
DOI10.1016/j.disc.2023.113696zbMath1525.05124OpenAlexW4386618582MaRDI QIDQ6080154
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113696
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity, remoteness and distance eigenvalues of a graph
- Spectra of graphs
- On the sum of \(k\) largest eigenvalues of graphs and symmetric matrices
- On the distance spectra of threshold graphs
- On the sum of \(k\) largest distance eigenvalues of graphs
- Improved results on Brouwer's conjecture for sum of the Laplacian eigenvalues of a graph
- A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs
- Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
- Extremal problems on distance spectra of graphs
- Distance spectra of graphs: a survey
- On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs
- Bounds on graph eigenvalues. II
- On the distance spectrum of graphs
- Cliques and the spectral radius
- On the full Brouwer's Laplacian spectrum conjecture
- Graph Energy
- The Grone-Merris Conjecture
- The distance spectrum of a tree
- The Laplacian Spectrum of a Graph II
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Eigenvalues and triangles in graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: The sum of the \(k\) largest distance eigenvalues of graphs