Computing inertia sets using atoms
DOI10.1016/J.LAA.2011.08.026zbMATH Open1241.05065OpenAlexW2124403692MaRDI QIDQ417545FDOQ417545
Authors: Steve Butler, H. Tracy Hall, John Sinkovic, Amy Yielding, Wayne Barrett, Wasin So, Colin Starr 
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Basic linear algebra (15A99) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of minimal rank and path cover number for certain graphs
- Multiplicities of eigenvalues and tree-width of graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- The minimum rank of symmetric matrices described by a graph: a survey
- Inertia sets for graphs on six or fewer vertices
- Graphs whose minimal rank is two
- The maximum corank of graphs with a 2-separation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)
- Graphs with magnetic Schrödinger operators of low corank
- On the minimum rank of the join of graphs and decomposable graphs
- Three-connected graphs whose maximum nullity is at most three
Cited In (3)
This page was built for publication: Computing inertia sets using atoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417545)
