Critical ideals, minimum rank and zero forcing number

Carlos A. Alfaro and Jephian C.-H. Lin

Applied Mathematics and Computation, 2019, vol. 358, issue C, 305-313

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, 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.

Keywords: Critical ideals; Forbidden induced subgraph; Minimum rank; Laplacian matrix; Zero forcing number (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319303315
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:358:y:2019:i:c:p:305-313

DOI: 10.1016/j.amc.2019.04.043

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().