The inertia sets of graphs with a 2-separation

DOI10.1016/j.laa.2014.09.013zbMath1301.05224OpenAlexW2051591516MaRDI QIDQ744118

Hein van der Holst

Publication date: 6 October 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.013

zbMATH Keywords

inertiasymmetric matrices2-separation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The minimum rank of symmetric matrices described by a graph: a survey
• Sub-direct sums and positivity classes of matrices
• The maximum corank of graphs with a 2-separation
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• Unnamed Item

This page was built for publication: The inertia sets of graphs with a 2-separation