Signed graphs with least eigenvalue \(<-2\)
A simple proof is given of the fact that every signed graph with an eigenvalue that is smaller than --2 contains an induced (signed) subgraph whose smallest eigenvalue is equal to --2.
scientific article; zbMATH DE number 64847