Computing inertia sets using atoms
From MaRDI portal
Publication:417545
Recommendations
Cites work
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 1303522 (Why is no real title available?)
- scientific article; zbMATH DE number 1557063 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Computation of minimal rank and path cover number for certain graphs
- Graphs whose minimal rank is two
- Graphs with magnetic Schrödinger operators of low corank
- Inertia sets for graphs on six or fewer vertices
- Multiplicities of eigenvalues and tree-width of graphs
- On the minimum rank of the join of graphs and decomposable graphs
- Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)
- 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
- 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)