L Auslander, E Feig, et al.
Advances in Applied Mathematics
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
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Conference paper
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991