Graphs with a small number of nonnegative eigenvalues
From MaRDI portal
Recommendations
Cited in
(16)- Characterization of graphs with exactly two non-negative eigenvalues
- A complete characterization of graphs with exactly two positive eigenvalues
- On graphs with a fixed number of negative eigenvalues
- scientific article; zbMATH DE number 4041958 (Why is no real title available?)
- Small graphs with exactly two non-negative eigenvalues
- On graphs with exactly two positive eigenvalues
- Signed complete graphs with exactly \(m\) non-negative eigenvalues
- Some graphs with exactly three non-negative eigenvalues
- False-twin-free graphs with a fixed number of negative eigenvalues
- Graphs with few distinct eigenvalues and extremal energy
- Graphs with Exactly Two Negative Eigenvalues
- scientific article; zbMATH DE number 4112640 (Why is no real title available?)
- Characterizing the negative inertia index of connected graphs in terms of their girth
- Maximal canonical graphs with seven nonzero eigenvalues
- Maximizing proper colorings on graphs
- On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\)
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)
