Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
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
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications