Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Conference paper
Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989