Record number :
Title of article :
Zero forcing sets and the minimum rank of graphs Original Research Article
Author/Authors :
AIM Minimum Rank – Special Graphs Work Group، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
From page :
To page :
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.
Keywords :
matrix , Rank , Symmetric matrix , graph , Minimum rank
Journal title :
Linear Algebra and its Applications
Serial Year :
Link To Document :