R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
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
Sankar Basu
Journal of the Franklin Institute
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics