Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below

Zilin Jiang, Alexandr Polyanskii

The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\hat{I}»$ can be defined by a…