A. Skumanich
SPIE OE/LASE 1992
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
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998