David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990