Minimum rank of outerplanar graphs
From MaRDI portal
Recommendations
- The inverse eigenvalue and inertia problems for minimum rank two graphs
- Universally optimal matrices and field independence of the minimum rank of a graph
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- Minimum-rank and maximum-nullity of graphs and their linear preservers
- Computation of minimal rank and path cover number for certain graphs
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Computation of minimal rank and path cover number for certain graphs
- Inertia sets for graphs on six or fewer vertices
- Maximum nullity of outerplanar graphs and the path cover number
- Minimum rank of edge subdivisions of graphs
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Minimum-rank matrices with prescribed graph
- On the maximum positive semi-definite nullity and the cycle matroid of graphs
- 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
- Universally optimal matrices and field independence of the minimum rank of a graph
- Zero forcing sets and the minimum rank of graphs
Cited in
(3)
This page was built for publication: Minimum rank of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417506)