Critical ideals, minimum rank and zero forcing number

摘要

There are profound relations between the zero forcing number and minimum rank of a graph. We study the relation of both parameters with a third one, the algebraic co-rank, which is defined as the largest i such that the ith critical ideal is trivial. This gives a new perspective for bounding and computing these three graph parameters.