Dynamic approach to k-forcing

By Yair Caro, Ryan D. Pepper. 2014

47 citations recorded by the source corpus.

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].

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/35dc7d2d63ed928aaf5d5c778877d8e9b99a71a5