Proof of Brouwer's conjecture (BC) for all graphs with number of vertices n>n₀ assuming that (BC) holds for n n₀ for some n₀ 10²⁴

DOI10.20310/2686-9667-2025-30-150-110-127MaRDI QIDQ6943189zbMATH OpenFDO

Authors Vladimir Blinovsky, L. D. Sperança, A. N. Pchelintsev

Publication date 14 August 2025

Published in Vestnik Rossiĭskikh Universitetov. Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20310/2686-9667-2025-30-150-110-127

zbMATH Keywords

eigenvaluesLaplacian of graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• On the sum of Laplacian eigenvalues of graphs
• Shifted simplicial complexes are Laplacian integral
• Spectra of graphs
• Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
• The Grone-Merris conjecture
• The Laplacian Spectrum of a Graph II
• Upper bounds for the sum of Laplacian eigenvalues of graphs

This page was built for publication: 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}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943189)