Graphs and matrices of maximal energy
classification
🧮 math.CO
keywords
energygraphsmatricesmaximalclosecallcharacterizingconjecture
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.