Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Paper
On the distribution of the maximum eigenvalue of graphs
Abstract
Given a graph G, let λ (G) denote the largest eigenvalue of the adjacency matrix of G. We prove that for any λ ≥ 2+ 5 ( = 2.058+) there exists a sequence of graphs G1,G2,... such that limk→∞λ(Gk) = λ, thus answering a question posed by Hoffman. © 1989.
Related
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering