Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
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
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008