The failed zero forcing number of a graph
From MaRDI portal
Recommendations
Cited in
(19)- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- Blocking zero forcing processes in Cartesian products of graphs
- On leaky forcing and resilience
- Iteration index of a zero forcing set in a graph
- Failed skew zero forcing on a graph
- Failed zero forcing and critical sets on directed graphs
- Failed power domination on graphs
- Computing the zero forcing number for generalized Petersen graphs
- Immune sets in monotone infection rules. Characterization and complexity
- A lower bound on the failed zero-forcing number of a graph
- Sparks of symmetric matrices and their graphs
- Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
- The zero forcing span of a graph
- Failed zero forcing numbers of trees and circulant graphs
- Well-failed graphs
- Failed zero forcing numbers of Grassmann graphs
- On the size of immune sets in the k-PULL infection model
- On the number of minimal forts of a graph
- On the complexity of failed zero forcing
This page was built for publication: The failed zero forcing number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340141)