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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 1303745 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Matrix Analysis
- Maximal energy graphs
- On the energy of some circulant graphs
- Quasi-random graphs
- The energy of graphs and matrices
Cited in
(23)- On bipartite graphs with minimal energy
- Characteristic power series of graph limits
- Maximum norms of graphs and matrices, and their complements
- Remarks on the energy of regular graphs
- Regular graphs with maximal energy per vertex
- Borderenergetic Graphs of Order 12
- Extrema of graph eigenvalues
- scientific article; zbMATH DE number 7335987 (Why is no real title available?)
- On borderenergetic graphs
- Maximal energy graphs
- The energy of a type of lattice
- A note on maximal Schatten p-norms of a graph
- Extremal norms of graphs and matrices
- The cordial energy of some graphs
- All hypoenergetic graphs with maximum degree at most 3
- Beyond graph energy: norms of graphs and matrices
- Maximal energy of subdivisions of graphs with a fixed chromatic number
- Some properties of maximum deficiency energy of a graph
- On the energy of \((0, 1)\)-matrices
- Strongly regular graphs with maximal energy
- Lower bounds for the energy of digraphs
- Spectra of digraphs
- A lower bound for the spectral radius of a digraph
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)