arXiv Analytics

Sign in

arXiv:1711.00374 [math.CO]AbstractReferencesReviewsResources

Graph classes for critical ideals, minimum rank and zero forcing number

Carlos A. Alfaro

Published 2017-10-31Version 1

Recently, there have been found new relations between the zero forcing number and the minimum rank of a graph with the algebraic co-rank. We continue on this direction by giving a characterization of the graphs with real algebraic co-rank at most 2. This implies that for any graph with at most minimum rank at most 3, its minimum rank is bounded from above by its real algebraic co-rank.

Comments: 8 pages, 2 figures. arXiv admin note: text overlap with arXiv:1710.03386
Categories: math.CO
Subjects: 05C25, 05C50, 05E99, 13P15, 15A03, 68W30
Related articles: Most relevant | Search more
arXiv:1710.03386 [math.CO] (Published 2017-10-10)
Critical ideals, minimum rank and zero forcing number
arXiv:0812.1616 [math.CO] (Published 2008-12-09)
Program for calculating bounds on the minimum rank of a graph using Sage
arXiv:0812.0870 [math.CO] (Published 2008-12-04)
Table of minimum ranks of graphs of order at most 7 and selected optimal matrices