Critical ideals, minimum rank and zero forcing number
Combinatorics
2017-10-11 v1
Abstract
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; that is defined as the largest such that the -th critical ideal is trivial. This gives a new perspective for bounding and computing these three graph parameters.
Keywords
Cite
@article{arxiv.1710.03386,
title = {Critical ideals, minimum rank and zero forcing number},
author = {Carlos A. Alfaro and Jephian C. -H. Lin},
journal= {arXiv preprint arXiv:1710.03386},
year = {2017}
}