Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
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.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
James Lee Hafner
Journal of Number Theory
Igor Devetak, Andreas Winter
ISIT 2003