The inertia sets of graphs with a 2-separation

DOI10.1016/J.LAA.2014.09.013MaRDI QIDQ744118zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

2-separationinertiasymmetric matrices

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5066380 (Why is no real title available?)
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• Sub-direct sums and positivity classes of matrices
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The maximum corank of graphs with a 2-separation
• The minimum rank of symmetric matrices described by a graph: a survey

Cited in

(8)

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

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)