On graphs whose smallest eigenvalue is at least − 1 − √2

On graphs whose second largest eigenvalu

On graphs whose second largest eigenvalue does not exceed (√5−1)2

✍ Dragoš Cvetković; Slobodan Simić 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 690 KB

It is well known in the theory of graph spectra that connected graphs except for complete multipartite (including complete) graphs have the second largest eigenvalue greater than 0. Graphs whose second largest eigenvalue does not exceed ~ are characterized in . In this paper we study the structure o