A complete characterization of graphs with exactly two positive eigenvalues
From MaRDI portal
Abstract: In 1977 Smith characterized graphs with exactly one positive eigenvalue. Since then, many particular results related to graphs with exactly two positive eigenvalues have emerged. In this paper we conclude this investigation by giving a full characterization of these graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3580591 (Why is no real title available?)
- Bipartite graphs with at most six non-zero eigenvalues
- Characterization of graphs with exactly two non-negative eigenvalues
- Characterizations of derived graphs
- Graphs with a small number of nonnegative eigenvalues
- Inequalities for Graph Eigenvalues
- On graphs with a fixed number of negative eigenvalues
- On graphs with exactly one eigenvalue less than -1
- On graphs with exactly two positive eigenvalues
- On the third largest eigenvalue of graphs
- Positive and negative inertia index of a graph
- Signed graphs with cut points whose positive inertia indexes are two
- Signed graphs with small positive index of inertia
- Small graphs with exactly two non-negative eigenvalues
- Spectra of graphs obtained by a generalization of the join graph operation
Cited in
(12)- Graphs with Exactly Two Negative Eigenvalues
- scientific article; zbMATH DE number 32147 (Why is no real title available?)
- Graph covers with two new eigenvalues
- Characterization of completely positive graphs
- Spectral deviations of graphs
- scientific article; zbMATH DE number 4023327 (Why is no real title available?)
- On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\)
- scientific article; zbMATH DE number 6129825 (Why is no real title available?)
- On graphs with exactly two positive eigenvalues
- Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues \ge - 2
- On signed graphs with at most three positive eigenvalues
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
This page was built for publication: A complete characterization of graphs with exactly two positive eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111197)