Graphs with three eigenvalues and second largest eigenvalue at most 1
From MaRDI portal
Abstract: We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.
Recommendations
- On graphs whose second largest eigenvalue is at most 1
- Graphs with second largest eigenvalue less than 1/2
- On graphs with second largest eigenvalue less than 1
- On graphs whose second largest eigenvalue is less than 1
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- On the third largest eigenvalue of graphs
- On the third largest eigenvalue of a graph
- On graphs with three eigenvalues
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Regular graphs whose second largest eigenvalue is at most 1
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3825855 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Biregular graphs with three eigenvalues
- Graphs with many valencies and few eigenvalues
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Line graphs, root systems, and elliptic geometry
- Nonregular graphs with three eigenvalues
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- On graphs with just three distinct eigenvalues
- On graphs with three eigenvalues
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- The Magma algebra system. I: The user language
- The combinatorics of Dom de Caen
- The minimal spectral radius of graphs with a given diameter
Cited in
(26)- The spectral determinations of the join of two friendship graphs
- On graphs with three distinct signless Laplacian eigenvalues
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
- Hypercubes are determined by their distance spectra
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- On graphs whose second largest eigenvalue is at most 1
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Some new aspects of main eigenvalues of graphs
- Graphs with second largest eigenvalue less than 1/2
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Characterization of graphs with an eigenvalue of large multiplicity
- The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
- More on signed graphs with at most three eigenvalues
- A problem concerning graphs with just three distinct eigenvalues
- The spectral determinations of connected multicone graphs \(K_{\mathcal{W}} \operatorname{\nabla} mCP(n)\)
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
- Quadratic embedding constants of graph joins
- Spectral characterization of the complete graph removing a cycle
- Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
- Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
- Signed graphs with three eigenvalues: biregularity and beyond
- Signed graphs with at most three eigenvalues
This page was built for publication: Graphs with three eigenvalues and second largest eigenvalue at most 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684121)
