Minimum rank of outerplanar graphs
From MaRDI portal
Publication:417506
DOI10.1016/j.laa.2012.01.008zbMath1241.05026MaRDI QIDQ417506
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.2012.01.008
graph; outerplanar; cover; symmetric; minimum rank; inertia set; positive semidefinite minimum rank; universally optimal matrix
05C10: Planar graphs; geometric and topological aspects of graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15B57: Hermitian, skew-Hermitian, and related matrices
15A03: Vector spaces, linear dependence, rank, lineability
Cites Work
- Unnamed Item
- Unnamed Item
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Maximum nullity of outerplanar graphs and the path cover number
- The minimum rank of symmetric matrices described by a graph: a survey
- Computation of minimal rank and path cover number for certain graphs
- The maximum corank of graphs with a 2-separation
- Zero forcing sets and the minimum rank of graphs
- Minimum-rank matrices with prescribed graph
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- On the maximum positive semi-definite nullity and the cycle matroid of graphs
- Minimum rank of edge subdivisions of graphs
- Inertia sets for graphs on six or fewer vertices