Variants on the minimum rank problem: A survey II

Details Variants on the minimum rank problem: A survey II Variants on the minimum rank problem: A survey II

2011-02-25

arxiv.org/abs/1102.5142v1

Mathematics

Combinatorics

3 figures

Scientific paper

The minimum rank problem for a (simple) graph $G$ is to determine the smallest possible rank over all real symmetric matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. This paper surveys the many developments on the (standard) minimum rank problem and its variants since the survey paper \cite{FH}. In particular, positive semidefinite minimum rank, zero forcing parameters, and minimum rank problems for patterns are discussed.

Affiliated with

Also associated with

No associations

Rating

Variants on the minimum rank problem: A survey II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Variants on the minimum rank problem: A survey II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variants on the minimum rank problem: A survey II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709189