Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Nimrod Megiddo
Journal of Symbolic Computation
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007