Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
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
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence