Zero forcing in triangulations
From MaRDI portal
Publication:2423536
Recommendations
Cites work
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Domination in Graphs Applied to Electric Power Networks
- Zero forcing and power domination for graph products
- Zero forcing sets and the minimum rank of graphs
Cited in
(13)- Note on forcing problem of trees
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Minimal zero forcing sets
- Bounds on the connected forcing number of a graph
- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- Edge forcing in butterfly networks
- Blocking zero forcing processes in Cartesian products of graphs
- Special issue: Selected papers of CMMSE
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- Zero forcing density of Archimedean tiling graphs
- The zero forcing number of claw-free cubic graphs
- On the zero forcing number of generalized Sierpiński graphs
- Three-state zero forcing on graphs
This page was built for publication: Zero forcing in triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423536)