Graph classes for critical ideals, minimum rank and zero forcing number
Combinatorics
2020-05-06 v1
Abstract
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.
Cite
@article{arxiv.1711.00374,
title = {Graph classes for critical ideals, minimum rank and zero forcing number},
author = {Carlos A. Alfaro},
journal= {arXiv preprint arXiv:1711.00374},
year = {2020}
}
Comments
8 pages, 2 figures. arXiv admin note: text overlap with arXiv:1710.03386