A. E. Brouwer and A. Neumaier, The graphs with spectral radius between 2 and p2 + √5, Linear Algebra Appl. 115 (1989) 273-276. [OpenAIRE]
 S. M. Cioabaˇ, E. R. van Dam, J. H. Koolen, and J. Lee, Asymptotic results on the spectral radius and the diameter of graphs, Linear Algebra Appl. 432 (2010) 722-737.
 E. R. van Dam and R. E. Kooij, The minimal spectral radius of graphs with a given diameter, Linear Algebra Appl. 423 (2007) 408-419.
 D. M. Cvetkovi´c, M. Doob, and I. Gutman, On graphs whose spectral radius does not exceed (2 + √5)1/2, Ars Combin. 14 (1982) 225-239.
 X. Yuan, J. Shao and Y. Liu, The minimal spectral radius of graphs of order n with diameter n − 4, Linear Algebra Appl. 428 (2008) 2840-2851.
 D. M. Cvetkovi´c, M. Doob and H. Sachs, Spectra of Graphs, Theory and Application, 15th ed, NewYork: Academic Press, 1980.
 A. J. Hoffman and J. H. Smith, On the spectral radii of topologically equivalent graphs, in: Fiedler (Ed.), Recent Advances in Graph Theory, Academia Praha, New York. (1975) 273-281.
 A. Hoffman, On limit points of spectral radii of non-negative symmetrical integral matrices, pp. 165 - 172 in: Lecture Notes in Math. 303, Springer, Berlin 1972.
 B. N. Parlett, The Symmetric Eigenvalue Problems, Prentice-Hall, Englewood Cliffs, NJ, 1980.
 A. J. Schwenk, Computing the characteristic polynomial of a graph, in: Graphs and Combinatorics, Lect. Notes in Math., vol. 406 (1974) 153-172.
 J. H. Smith, Some properties of the spectrum of a graph, 1970 Combinatorial Structures and their Applications, pp. 403-406, Gordan and Breach, New York.
 J. Lan, L. Lu, and L. Shi, Graphs with Diameter n − e Minimizing the Spectral Radius, submitted, http://arxiv.org/abs/1110.2444.
 X. Sun, Sorting graphs with with given diameter by spectral radius, Master Thesis, Tsinghua University, 2008 (in Chinese).
 J. Wang, Q. Huang, X. An, and F. Belardo, Some notes on graphs whose spectral radius is close to 23 √2, Linear Algebra Appl. 429 (2008) 1606-1618.
 R. Woo and A. Neumaier, On graphs whose spectral radius is bounded by 23 √2, Graphs Combin. 23 (2007) 713-726.