Graphs with at most two nonzero distinct absolute eigenvalues

Authors N. E. Arévalo, Rodrigo O. Braga, Virgínia M. Rodrigues

Publication date 3 October 2020

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Abstract: In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph, respectively. We show that these graphs have at most two nonzero distinct absolute eigenvalues and investigate the proposed problems organizing our study according to the type of spectrum they can have. In most cases all graphs are characterized. Infinite families of graphs are given otherwise. We also show that all graphs satifying the properties required in the problems are integral, except for complete bipartite graphs

K_{p, q}

and disconnected graphs with a connected component

K_{p, q}

, where

p q

is not a perfect square.

This page was built for publication: Graphs with at most two nonzero distinct absolute eigenvalues

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