The following pages link to The Zero Forcing Number of Graphs (Q4610449):
Displayed 18 items.
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- Uniform forcing and immune sets in graphs and hypergraphs (Q2235248) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- Edge Forcing in Butterfly Networks (Q5025049) (← links)
- (Q5076794) (← links)
- Constructions of cospectral graphs with different zero forcing numbers (Q5078599) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- (Q6119465) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- (Q6179673) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)