Dynamic approach to k-forcing

Authors

Yair CaroFollow
Ryan Pepper, University of Houston - DowntownFollow

Publication Date

2015

Abstract

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 [2], while also answering an open problem posed by Meyer [9].

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Caro, Yair and Pepper, Ryan (2015) "Dynamic approach to k-forcing," Theory and Applications of Graphs: Vol. 2: Iss. 2, Article 2.
DOI: 10.20429/tag.2015.020202
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/2