Lower bounds in minimum rank problems

DOI10.1016/J.LAA.2009.08.023MaRDI QIDQ1044621zbMATH OpenOpenAlexFDO

Authors Lon H. Mitchell, S. K. Narayan, Andrew M. Zimmer

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 rankzero forcing setminimum semidefinite rank

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)

Recommendations

• Zero forcing sets and the minimum rank of graphs
• A new lower bound for the positive semidefinite minimum rank of a graph
• A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• Zero forcing parameters and minimum rank problems

Cites work

• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• A correction: Orthogonal representations and connectivity of graphs
• An upper bound for the minimum rank of a graph
• Bounds for minimum semidefinite rank from superpositions and cutsets
• Graphs whose minimal rank is two
• Linearly independent vertices and minimum semidefinite rank
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the Shannon capacity of a graph
• On the minimum semidefinite rank of a simple graph
• Orthogonal representations and connectivity of graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Three-connected graphs whose maximum nullity is at most three
• Vector representations of graphs
• Zero forcing sets and the minimum rank of graphs

Cited in

(21)

• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• Frame graph
• Lower bounds for matrix factorization
• Lower bounds for matrix factorization
• scientific article; zbMATH DE number 1066407 (Why is no real title available?)
• Bounds on minimum semidefinite rank of graphs
• A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph
• The minimum rank problem over finite fields
• Graphs of unitary matrices and positive semidefinite zero forcing
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• A new lower bound for the positive semidefinite minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs
• An upper bound for the minimum rank of a graph
• scientific article; zbMATH DE number 6315784 (Why is no real title available?)
• The sieving process and lower bounds for the minimum rank problem
• Orthogonal representations of Steiner triple system incidence graphs
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• On extremal graphs for zero forcing number
• Positive semidefinite zero forcing
• Bounds for minimum semidefinite rank from superpositions and cutsets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044621)