Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
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
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences