Graphs and matrices with maximal energy (Q860609): Difference between revisions

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.