Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Let G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) exceeds -1 - √2 and every vertex of G has large valence, then the least eigenvalue is at least -2 and G is a generalized line graph. © 1997.
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Imran Nasim, Melanie Weber
SCML 2024
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Chai Wah Wu
Linear Algebra and Its Applications