Graphs and matrices with maximal energy

From MaRDI portal



Abstract: Call the sum of the singular values of a matrix A the energy of A. We investigate graphs and matrices of energy close to the maximal one. We prove a conjecture of Koolen and Moulten and give a stability theorem characterizing all square nonnegative matrices and all graphs with energy close to the maximal one. In particular, such graphs are quasi-random.


To any graph \(G\) was defined and studied the function \(\varepsilon(G)\), the so-called energy of a graph \(G\). The author defines a new modification of the function \(\varepsilon(G)\) and proves that for all sufficienty large \(n\), there exists a graph \(G\) with \(n\) vertices such that \(\varepsilon(G)\geq {n^{3/2}\over 2}- n^{n/10}\). From that statement follows the conjecture of Koolen and Moulton. At the end the author characterizes all graphs with energy close to the maximal one.











This page was built for publication: Graphs and matrices with maximal energy

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