Zero forcing in triangulations
DOI10.1016/J.CAM.2018.05.055zbMATH Open1414.05226OpenAlexW2805488207WikidataQ62618156 ScholiaQ62618156MaRDI QIDQ2423536FDOQ2423536
Authors: Gregorio Hernández, José Ranilla, Sandra Ranilla-Cortina 
Publication date: 20 June 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.05.055
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Domination in Graphs Applied to Electric Power Networks
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Zero forcing and power domination for graph products
- A Graph Reduction Step Preserving Element-Connectivity and Applications
Cited In (11)
- Blocking zero forcing processes in Cartesian products of graphs
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- On the zero forcing number of generalized Sierpiński graphs
- Special issue: Selected papers of CMMSE
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Three-state zero forcing on graphs
- The zero forcing number of claw-free cubic graphs
- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- Note on forcing problem of trees
- Bounds on the connected forcing number of a graph
- Edge forcing in butterfly networks
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)
