Graphs with a small number of nonnegative eigenvalues
From MaRDI portal
Using a mixture of computer search and theoretical consideration, the author determines all graphs with at most two nonnegative eigenvalues. Having noted that \(2K_1\) is the only minimal graph with two nonnegative eigenvalues, the author goes on to determine all minimal graphs with three nonnegative eigenvalues. There are exactly 285 such graphs.
Recommendations
Cited in
(20)- On graphs with a fixed number of negative eigenvalues
- False-twin-free graphs with a fixed number of negative eigenvalues
- Graphs with few distinct eigenvalues and extremal energy
- Signed complete graphs with exactly \(m\) non-negative eigenvalues
- A complete characterization of graphs with exactly two positive eigenvalues
- Graphs with Exactly Two Negative Eigenvalues
- scientific article; zbMATH DE number 4041958 (Why is no real title available?)
- scientific article; zbMATH DE number 4112640 (Why is no real title available?)
- Maximal canonical graphs with seven nonzero eigenvalues
- Maximizing proper colorings on graphs
- Small graphs with exactly two non-negative eigenvalues
- Some graphs with exactly three non-negative eigenvalues
- On graphs with exactly two positive eigenvalues
- Characterization of graphs with exactly two non-negative eigenvalues
- On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\)
- Characterizing the negative inertia index of connected graphs in terms of their girth
- On signed graphs with at most three positive eigenvalues
- Some results on the complete sigraphs with exactly three non-negative eigenvalues
- A characterization of (K_n,U^-) in the class L(3)
- Spectral deviations of graphs
This page was built for publication: Graphs with a small number of nonnegative eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300000)
