References
- Petrovi\’{c} M. On graphs whose second largest eigenvalue does not exceed 2-1. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 1993;4:73–78.
- Torgašev A. Graphs whose second least eigenvalue is greater than -1. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 1982;735–762:148–154.
- Smith JH. Some properties of the spectrum of a graph. Combinatorial structures and their applications. New York (NY): Gordon and Breach; 1970. p. 403–406.
- van Dam ER, Spence E. Combinatorial designs with two singular values–I: uniform multiplicative designs. J. Combin. Theory Ser. A. 2004;107:127–142.
- Cioabă SM, Haemers WH, Vermette JR, Wong W. The graphs with all but two eigenvalues equal to ±1. J. Algebraic Combin. 2015;41:887–897.
- Petrovi\’{c} M. On graphs with exactly one eigenvalue less than -1. J. Combin. Theory Ser. B. 1991;52:102–112.
- Neumaier A. The second largest eigenvalue of a tree. Linear Algebra Appl. 1982;46:9–25.
- Brouwer AE, Haemers WH. Spectra of graphs. New York (NY): Springer; 2012.