Zero forcing versus domination in cubic graphs
From MaRDI portal
Publication:2025087
DOI10.1007/s10878-020-00692-zzbMath1464.05282OpenAlexW3125507105MaRDI QIDQ2025087
Michael A. Henning, Randy Davila
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00692-z
Related Items (3)
On the zero forcing number and spectral radius of graphs ⋮ On the semitotal forcing number of a graph ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Generalized power domination of graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Some bounds on the zero forcing number of a graph
- Perfect Roman domination in trees
- On the total forcing number of a graph
- The relationship between \(k\)-forcing and \(k\)-power domination
- Bounds on the connected forcing number of a graph
- Total forcing and zero forcing in claw-free cubic graphs
- A lower bound on the zero forcing number
- Total forcing versus total domination in cubic graphs
- Complexity and computation of connected zero forcing
- Total forcing sets and zero forcing sets in trees
- A short proof for a lower bound on the zero forcing number
- Zero forcing in claw-free cubic graphs
- Minimum rank and zero forcing number for butterfly networks
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Generalized Power Domination in Regular Graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- The forcing number of graphs with given girth
- On Representatives of Subsets
- Domination in Graphs Applied to Electric Power Networks
- Total Domination in Graphs
- A Taxonomy of Perfect Domination
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
This page was built for publication: Zero forcing versus domination in cubic graphs
