10 citations · 12 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Dynamic approach to k-forcing
Yair Caro, Ryan Pepper
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…
math.CO2014★ 10 cited
Upper bounds on the k-forcing number of a graph
David Amos, Yair Caro, Randy Davila +1
Given a simple undirected graph and a positive integer , the -forcing number of , denoted , is the minimum number of vertices that need to be initially colored…