The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepper , while also answering an open problem posed by Meyer .
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Caro, Yair and Pepper, Ryan
"Dynamic approach to k-forcing,"
Theory and Applications of Graphs: Vol. 2
, Article 2.
Available at: http://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2