On the sum of \(k\) largest distance eigenvalues of graphs
From MaRDI portal
Publication:1735686
DOI10.1016/j.dam.2018.12.031zbMath1407.05151arXiv1805.09661OpenAlexW2963340133MaRDI QIDQ1735686
Publication date: 28 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09661
Related Items (7)
A short note on the sum of \(k\) largest distance eigenvalues of bipartite graphs ⋮ On the second largest distance eigenvalue of a block graph ⋮ The sum of the \(k\) largest distance eigenvalues of graphs ⋮ On Schatten \(p\)-norm of the distance matrices of graphs ⋮ On the second largest eigenvalue of the generalized distance matrix of graphs ⋮ Extremal problems on distance spectra of graphs ⋮ Perfect matching and distance spectral radius in graphs and bipartite graphs
Uses Software
Cites Work
- Unnamed Item
- Proximity, remoteness and distance eigenvalues of a graph
- Remoteness and distance eigenvalues of a graph
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- Spectra of graphs
- On the sum of \(k\) largest eigenvalues of graphs and symmetric matrices
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Distance spectra of graphs: a survey
- Ramsey numbers, graph eigenvalues, and a conjecture of Cao and Yuan
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
- On distance integral graphs
- On the least distance eigenvalue and its applications on the distance spread
- The Grone-Merris Conjecture
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- The Laplacian Spectrum of a Graph II
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- On Distance Spectral Radius and Distance Energy of Graphs
This page was built for publication: On the sum of \(k\) largest distance eigenvalues of graphs
