Computing inertia sets using atoms

DOI10.1016/j.laa.2011.08.026zbMath1241.05065OpenAlexW2124403692MaRDI QIDQ417545

Steve Butler, H. Tracy Hall, Amy Yielding, John Sinkovic, Wa-Sin So, Colin L. Starr, Wayne W. Barrett

Publication date: 14 May 2012

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

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

zbMATH Keywords

inertiaatomssymmetric matricesminimum rank probleminverse inertia problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Basic linear algebra (15A99) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

Ordered multiplicity inverse eigenvalue problem for graphs on six vertices ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• On the minimum rank of the join of graphs and decomposable graphs
• Three-connected graphs whose maximum nullity is at most three
• The minimum rank of symmetric matrices described by a graph: a survey
• Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)
• Multiplicities of eigenvalues and tree-width of graphs
• Graphs with magnetic Schrödinger operators of low corank
• Computation of minimal rank and path cover number for certain graphs
• The maximum corank of graphs with a 2-separation
• Inertia sets for graphs on six or fewer vertices
• Graphs whose minimal rank is two
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs

This page was built for publication: Computing inertia sets using atoms