On graphs with a fixed number of negative eigenvalues
From MaRDI portal
A graph is called canonical if any two nonadjacent vertices have different neighbours. It is shown that the set of graphs having a fixed number of negative eigenvalues (including multiplicities) contains a finite number of canonical graphs.
Recommendations
Cites work
Cited in
(25)- Graphs with a small number of nonnegative eigenvalues
- Graph eigenspaces of small codimension
- Bicyclic graphs with small positive index of inertia
- Graphs whose distance matrix has at most three negative eigenvalues
- False-twin-free graphs with a fixed number of negative eigenvalues
- A complete characterization of graphs with exactly two positive eigenvalues
- The smallest positive eigenvalue of graphs under perturbation
- The positive and the negative inertia index of line graphs of trees
- Real symmetric matrices and their negative eigenvalues
- Conjectured bounds for the sum of squares of positive eigenvalues of a graph
- 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?)
- scientific article; zbMATH DE number 32146 (Why is no real title available?)
- scientific article; zbMATH DE number 1484336 (Why is no real title available?)
- scientific article; zbMATH DE number 3986 (Why is no real title available?)
- Maximal canonical graphs with seven nonzero eigenvalues
- Characterizations of graphs with given inertia index achieving the maximum diameter
- Bounds for the positive and negative inertia index of a graph
- On graphs with exactly two positive eigenvalues
- The estimation of the bound of the sum of squares of positive (negative) eigenvalues of a graph
- 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
- Triangle-free signed graphs with small negative inertia index
- A new conjecture on the inertia of graphs
This page was built for publication: On graphs with a fixed number of negative eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071034)
