A.R. Conn, Nick Gould, et al.
Mathematics of Computation
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
Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Conference paper
Characterization of a next generation step-and-scan system
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998