Matthew A Grayson
Journal of Complexity
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.
Matthew A Grayson
Journal of Complexity
Chai Wah Wu
Linear Algebra and Its Applications
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
J. LaRue, C. Ting
Proceedings of SPIE 1989