Minimum rank, maximum nullity, and zero forcing number of simple digraphs

DOI10.13001/1081-3810.1686zbMath1282.05095OpenAlexW206680390MaRDI QIDQ5746842

No author found.

Publication date: 10 February 2014

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1243&context=math_pubs

zbMATH Keywords

minimum rankmaximum nullityzero forcing numbersimple directed graphsimple digraph

Mathematics Subject Classification ID

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

Related Items (5)

On the zero forcing number and propagation time of oriented graphs ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Zero forcing in iterated line digraphs ⋮ Zero forcing propagation time on oriented graphs ⋮ On the zero forcing number of a graph involving some classical parameters

This page was built for publication: Minimum rank, maximum nullity, and zero forcing number of simple digraphs