Lower bounds in minimum rank problems
type: Item
instance of: scholarly article
title: Lower bounds in minimum rank problems
zbMATH Open document ID: 1220.05077
author: Lon H. Mitchell
author: S. K. Narayan
author: Andrew M. Zimmer
published in: Linear Algebra and its Applications
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 15B57
zbMATH DE Number: 5650051
zbMATH Keywords: minimum rank
zbMATH Keywords: minimum semidefinite rank
zbMATH Keywords: zero forcing set
MaRDI profile type: Publication
full work available at URL: j.laa.2009.08.023
OpenAlex ID: W1998163797
cites work: Graphs whose minimal rank is two
cites work: Bounds for minimum semidefinite rank from superpositions and cutsets
cites work: An upper bound for the minimum rank of a graph
cites work: On the minimum semidefinite rank of a simple graph
cites work: On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
cites work: The minimum rank of symmetric matrices described by a graph: a survey
cites work: Q5704408
cites work: Zero forcing sets and the minimum rank of graphs
cites work: Linearly independent vertices and minimum semidefinite rank
cites work: Orthogonal representations and connectivity of graphs
cites work: A correction: Orthogonal representations and connectivity of graphs
cites work: On the Shannon capacity of a graph
cites work: Vector representations of graphs
cites work: Three-connected graphs whose maximum nullity is at most three
DOI: 10.1016/J.LAA.2009.08.023
description: scientific article; zbMATH DE number 5650051