The inertia sets of graphs with a 2-separation

DOI10.1016/J.LAA.2014.09.013zbMATH Open1301.05224OpenAlexW2051591516MaRDI QIDQ744118FDOQ744118

Authors: 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

Recommendations

• On the inertia set of a signed graph with loops
• The inertia set of the join of graphs
• Inertia sets for graphs on six or fewer vertices
• The inertia set of a signed graph
• Inertia sets of semicliqued graphs

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

• Title not available (Why is that?)
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• 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

Cited In (8)

• Computing inertia sets using atoms
• On the inertia set of a signed graph with loops
• Inertia sets for graphs on six or fewer vertices
• The maximum corank of graphs with a 2-separation
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The inertia set of the join of graphs
• Irreversible 2-conversion set in graphs of bounded degree
• Inertia sets of semicliqued graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744118)