Dynamic approach to k-forcing

2014/05/29 by Caro, Yair, Pepper, Ryan
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1405.7573

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

Related

• Proof of a conjecture on the zero forcing number of a graph
• Upper bounds on the k-forcing number of a graph
• The relationship between k-forcing and k-power domination
• Computational Approaches for Zero Forcing and Related Problems
• Bounds on the connected forcing number of a graph