The Grone-Merris conjecture
From MaRDI portal
Abstract: In spectral graph theory, Grone and Merris conjecture that the spectrum of the Laplacian matrix of a finite graph is majorized by the conjugate degree sequence of this graph. We give a complete proof for this conjecture.
Recommendations
Cites work
- scientific article; zbMATH DE number 3383043 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A theorem on flows in networks
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Eigenvalues and the degree sequences of graphs
- Laplacian matrices of graphs: A survey
- Laplacian spectrum of weakly quasi-threshold graphs
- Near threshold graphs
- On arithmetic combinatorics and finite groups
- On the Grone-Merris conjecture
- Shifted simplicial complexes are Laplacian integral
- Split graphs
- The Laplacian Spectrum of a Graph II
- The splittance of a graph
Cited in
(46)- Brouwer's conjecture for the sum of the k largest Laplacian eigenvalues of some graphs
- On the sum of signless Laplacian spectra of graphs
- Upper bounds for the sum of Laplacian eigenvalues of graphs
- On the spectrum of threshold graphs
- On the sum of \(k\) largest Laplacian eigenvalues of a graph and clique number
- On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
- Upper bounds for the sum of Laplacian eigenvalues of a graph and Brouwer’s conjecture
- More inequalities for Laplacian indices by way of majorization
- On the sum of k largest distance eigenvalues of graphs
- The preservation property of Brouwer's conjecture
- The Laplacian energy of threshold graphs and majorization
- Constraints on Brouwer's Laplacian spectrum conjecture
- On the von Neumann entropy of a graph
- On the Grone-Merris conjecture
- Brouwer type conjecture for the eigenvalues of distance Laplacian matrix of a graph
- On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs
- Book review of: Xingzhi Zhan, Matrix theory.
- On a conjecture for the signless Laplacian eigenvalues
- On the Ky Fan norm of the signless Laplacian matrix of a graph
- Characterizing graphs with maximal Laplacian Estrada index
- Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
- A proof of Brouwer's conjecture for k = 3
- Improved results on Brouwer's conjecture for sum of the Laplacian eigenvalues of a graph
- The sum of the \(k\) largest distance eigenvalues of graphs
- Threshold graphs of maximal Laplacian energy
- On the sum of the eigenvalues of the distance Laplacian matrix of graphs with diameter three and four
- A Majorization Bound for the Eigenvalues of Some Graph Laplacians
- Partition density, star arboricity, and sums of Laplacian eigenvalues of graphs
- Bounds on the combinatorial Laplacian spectral radius for simplicial complexes
- Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
- Maximum Laplacian energy among threshold graphs
- On the full Brouwer's Laplacian spectrum conjecture
- scientific article; zbMATH DE number 3968689 (Why is no real title available?)
- scientific article; zbMATH DE number 6665042 (Why is no real title available?)
- On Laplacian eigenvalues of graphs and Brouwer's conjecture
- On the maximum Laplacian Estrada index of graphs
- Resolving Grosswald's conjecture on GRH
- Note on an upper bound for sum of the Laplacian eigenvalues of a graph
- Near threshold graphs
- Spectral characterization of threshold graphs by distance Laplacian matrices
- Relations between degrees, conjugate degrees and graph energies
- Analyzing RL components for Wagner's framework via Brouwer's conjecture
- Laplacian controllable graphs based on connecting two antiregular graphs
- The Merrifield-Simmons conjecture holds for bipartite graphs
- On the sum of signless Laplacian eigenvalues of a graph
- Proof of Brouwer's conjecture (BC) for all graphs with number of vertices \(n>n_0\) assuming that (BC) holds for \(n\leq n_0\) for some \(n_0 \leq 10^{24}\)
This page was built for publication: The Grone-Merris conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020347)