
Article
Zero forcing sets and the minimum rank of graphs
Linear Algebra and its Applications
Document Type
Article
Disciplines
Publication Version
Accepted Manuscript
Publication Date
4-1-2008
DOI
10.1016/j.laa.2007.10.009
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 introduces a new graph parameter, Z(G), that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often enabling computation of the minimum rank.
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
2008
Language
en
File Format
application/pdf
Citation Information
Francesco Barioli, Wayne Barrett, Steve Butler, Sebastian M. Cioabă, et al.. "Zero forcing sets and the minimum rank of graphs" Linear Algebra and its Applications Vol. 428 (2008) Available at: http://works.bepress.com/leslie-hogben/79/
This is a manuscript of an article from Linear Algebra and its Applications 428 (2008): 1628, doi:10.1016/j.laa.2007.10.009. Posted with permission.