Failed zero forcing and critical sets on directed graphs
From MaRDI portal
Publication:5026986
zbMath1486.05110arXiv1911.06705MaRDI QIDQ5026986
Publication date: 8 February 2022
Full work available at URL: https://arxiv.org/abs/1911.06705
Applications of graph theory (05C90) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Failed skew zero forcing on a graph
- Zero forcing propagation time on oriented graphs
- On the complexity of failed zero forcing
- Zero forcing parameters and minimum rank problems
- Zero forcing in iterated line digraphs
- The failed zero forcing number of a graph
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Zero forcing sets and the minimum rank of graphs
- Nondiscriminatory propagation on trees
- An Eulerian path approach to DNA fragment assembly
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Unnamed Item
- Unnamed Item
This page was built for publication: Failed zero forcing and critical sets on directed graphs