On graphs with a fixed number of negative eigenvalues

DOI10.1016/0012-365X(85)90184-0zbMath0585.05023MaRDI QIDQ1071034

Aleksandar Torgašev

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

negative eigenvaluescanonical graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (13)

Conjectured bounds for the sum of squares of positive eigenvalues of a graph ⋮ Real symmetric matrices and their negative eigenvalues ⋮ Bicyclic graphs with small positive index of inertia ⋮ On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\) ⋮ The positive and the negative inertia index of line graphs of trees ⋮ Characterizations of graphs with given inertia index achieving the maximum diameter ⋮ Unnamed Item ⋮ Bounds for the positive and negative inertia index of a graph ⋮ Graphs whose distance matrix has at most three negative eigenvalues ⋮ False-twin-free graphs with a fixed number of negative eigenvalues ⋮ On graphs with exactly two positive eigenvalues ⋮ The smallest positive eigenvalue of graphs under perturbation ⋮ A complete characterization of graphs with exactly two positive eigenvalues

Cites Work

• Graphs with Exactly Two Negative Eigenvalues
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs with a fixed number of negative eigenvalues