Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
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
Conference paper
Wavefront and caustic surfaces of refractive laser beam shaper
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics