Lower Bounds in Minimum Rank Problems

Citations of this article
Mendeley users who have this article in their library.


The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the given graph. The minimum semidefinite rank of a graph is the minimum rank among Hermitian positive semidefinite matrices with the given graph. We explore connections between OS-sets and a lower bound for minimum rank related to zero forcing sets as well as exhibit graphs for which the difference between the minimum semidefinite rank and these lower bounds can be arbitrarily large. © 2009 Elsevier Inc. All rights reserved.




Mitchell, L. H., Narayan, S. K., & Zimmer, A. M. (2010). Lower Bounds in Minimum Rank Problems. Linear Algebra and Its Applications, 432(1), 430–440. https://doi.org/10.1016/j.laa.2009.08.023

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free