L Auslander, E Feig, et al.
Advances in Applied Mathematics
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
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ