Minimum rank of outerplanar graphs

DOI10.1016/j.laa.2012.01.008zbMath1241.05026OpenAlexW2075057089MaRDI QIDQ417506

John Sinkovic, Mark Kempton

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

zbMATH Keywords

graphouterplanarcoversymmetricminimum rankinertia setpositive semidefinite minimum rankuniversally optimal matrix

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)

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

This page was built for publication: Minimum rank of outerplanar graphs