On graphs with exactly one eigenvalue less than -1
From MaRDI portal
Publication:1118615
DOI10.1016/0095-8956(91)90096-3zbMath0669.05048OpenAlexW70136917MaRDI QIDQ1118615
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90096-3
Related Items (22)
A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) ⋮ Some graphs determined by their spectra ⋮ On regular graphs with four distinct eigenvalues ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Spectral characterization of the complete graph removing a cycle ⋮ The non-bipartite graphs with all but two eigenvalues in [–1, 1] ⋮ Graphs with second largest eigenvalue less than 1/2 ⋮ Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 ⋮ Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\) ⋮ Unnamed Item ⋮ Bipartite graphs with small third Laplacian eigenvalue. ⋮ On the distribution of eigenvalues of graphs ⋮ On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1 ⋮ On graphs whose second largest eigenvalue is at most 1 ⋮ On graphs with exactly two positive eigenvalues ⋮ On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) ⋮ On the distribution of eigenvalues of graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ A complete characterization of graphs with exactly two positive eigenvalues
Cites Work
This page was built for publication: On graphs with exactly one eigenvalue less than -1
