This web page contains the abstract of my paper:
"On the Distribution of the Maximum Eigenvalues of Graphs", Linear Algebra and its Applications, 114/115(1989), p. 17-20.
Abstract: Given a graph G, let Y(G) denote the largest eigenvalue of the adjecency matrix of G. We prove that for any Y >= sqrt(2+sqrt(5)) (=2.058+) there exists a sequence of graphs G1,G2,... such that the limit as k goes to infinity of Y(Gk) = Y, thus answering a question posed by Hoffman.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]