On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs (Q2321369)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Brouwer's conjecture for the sum of k largest Laplacian eigenvalues of graphs |
scientific article; zbMATH DE number 7099568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs |
scientific article; zbMATH DE number 7099568 |
Statements
On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs (English)
0 references
29 August 2019
0 references
For a graph \(G\) with \(n\) vertices and \(m\) edges, let \(\mathcal{S}_k(G)\) be the sum of the \(k\) largest Laplacian eigenvalues of \(G\). \textit{A. E. Brouwer} and \textit{W. H. Haemers} [Spectra of graphs. Berlin: Springer (2012; Zbl 1231.05001)] conjectured that \[ \mathcal{S}_k(G) \leq m + k +\frac{1}{2}, \] for any \(1\leq k\leq n\). In this paper, the author shows that if Brouwer's conjecture is true for all graphs with \(k = p\), with \(1 \leq p \leq (n - 1)/2\), then it is also true for all graphs when \(k = n -p - 1\). In addition, if the conjecture is true for a graph \(G\), then it is also true for its complement.
0 references
Brouwer's conjecture
0 references
sum of Laplacian eigenvalues
0 references
complement
0 references
0.97907114
0 references
0.9663382
0 references
0.9601382
0 references
0.9579895
0 references
0.95433784
0 references
0.9499681
0 references
0.9364504
0 references
0.9328578
0 references
0.93200916
0 references