Recommendations
Cites work
- A protocol for cooling and controlling composite systems by local interactions
- Classes of graphs with minimum skew rank 4
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Matching theory
- Minimum rank of graphs with loops
- Minimum rank of skew-symmetric matrices described by a graph
- Minimum rank with zero diagonal
- Nondiscriminatory propagation on trees
- On the complexity of the positive semidefinite zero forcing number
- On zero forcing number of graphs and their complements
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Positive semidefinite zero forcing
- Positive semidefinite zero forcing: complexity and lower bounds
- Propagation time for zero forcing on a graph
- The failed zero forcing number of a graph
- The maximum nullity of a complete subdivision graph is equal to its zero forcing number
- The minimum rank of symmetric matrices described by a graph: a survey
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
Cited in
(10)- Failed power domination on graphs
- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- The zero forcing span of a graph
- Immune sets in monotone infection rules. Characterization and complexity
- Fractional zero forcing via three-color forcing games
- On Grundy total domination number in product graphs
- Skew throttling
- Failed zero forcing and critical sets on directed graphs
- On the complexity of failed zero forcing
- The failed zero forcing number of a graph
This page was built for publication: Failed skew zero forcing on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314747)