Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum