Lower bounds in minimum rank problems

DOI10.1016/j.laa.2009.08.023zbMath1220.05077OpenAlexW1998163797MaRDI QIDQ1044621

Sivaram K. Narayan, Andrew M. Zimmer, Lon H. Mitchell

Publication date: 18 December 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.023

zbMATH Keywords

minimum semidefinite rankminimum rankzero forcing set

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (12)

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Positive semidefinite zero forcing ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Graphs of unitary matrices and positive semidefinite zero forcing ⋮ Frame graph ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Zero forcing parameters and minimum rank problems ⋮ On extremal graphs for zero forcing number

Cites Work

• Unnamed Item
• Bounds for minimum semidefinite rank from superpositions and cutsets
• Vector representations of graphs
• Linearly independent vertices and minimum semidefinite rank
• Three-connected graphs whose maximum nullity is at most three
• An upper bound for the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• A correction: Orthogonal representations and connectivity of graphs
• Orthogonal representations and connectivity of graphs
• Zero forcing sets and the minimum rank of graphs
• On the minimum semidefinite rank of a simple graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the Shannon capacity of a graph
• Graphs whose minimal rank is two

This page was built for publication: Lower bounds in minimum rank problems