152
Views
4
CrossRef citations to date
0
Altmetric
Articles

The non-bipartite graphs with all but two eigenvalues in [–1, 1]

, &
Pages 526-544 | Received 09 Nov 2015, Accepted 24 May 2016, Published online: 13 Jun 2016

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.