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 .
Caro, Yair and Pepper, Ryan
"Dynamic approach to k-forcing,"
Theory and Applications of Graphs:
2, Article 2.
Available at: http://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2