Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
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
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI