Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
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
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985