Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements