Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs

DOI10.2140/INVOLVE.2015.8.147MaRDI QIDQ2340149zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 April 2015

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2015.8.147

zbMATH Keywords

maximum nullityminimum rankoriented graphpath cover numbersimple digraphzero forcing number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Minimum rank, maximum nullity, and zero forcing number of simple digraphs
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs
• Minimum rank, maximum nullity and zero forcing number for selected graph families

Cited in

(9)

• On the zero forcing number and propagation time of oriented graphs
• Failed skew zero forcing on a graph
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Nullity of a graph in terms of path cover number
• Failed zero forcing and critical sets on directed graphs
• Zero forcing propagation time on oriented graphs
• Minimum rank, maximum nullity, and zero forcing number of simple digraphs
• Throttling for standard zero forcing on directed graphs
• Maximum nullity of outerplanar graphs and the path cover number

This page was built for publication: Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340149)