|
|||||
|
|
Lower Bounds in Minimum Rank Problems |
|
| Authors: | Lon H. Mitchell Sivaram K. Narayan |
| Affiliation: | a Department of Mathematics, Virginia Commonwealth University, Richmond, VA 23284-2014, United States b Department of Mathematics, Central Michigan University, Mount Pleasant, MI 48859, United States c Department of Mathematics, University of Illinois, Urbana, IL 61801, United States |
| Abstract: | 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. |
| Keywords: | 15A18 15A57 05C50 |
| 本文献已被 ScienceDirect 等数据库收录！ | |