Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
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
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.