M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Paper
On graphs whose least eigenvalue exceeds - 1 - √2
Abstract
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.
Related
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics