Campus Units
Mathematics
Document Type
Article
Publication Version
Submitted Manuscript
Publication Date
10-2007
Journal or Book Title
Linear Algebra and its Applications
Volume
426
DOI
10.1016/j.laa.2007.05.036
Abstract
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. This paper surveys the current state of knowledge on the problem of determining the minimum rank of a graph and related issues.
Rights
This manuscript version is made available under the CCBY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Owner
Elsevier Inc.
Copyright Date
2007
Language
en
File Format
application/pdf
Recommended Citation
Fallat, Shaun M. and Hogben, Leslie, "The Minimum Rank of Symmetric Matrices Described by a Graph: A Survey" (2007). Mathematics Publications. 85.
https://lib.dr.iastate.edu/math_pubs/85
Comments
This is a manuscript of an article from Linear Algebra and its Applications 426 (2007): 558, doi:10.1016/j.laa.2007.05.036. Posted with permission.