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

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.

No reviews yet.

No comments yet.