36 citations · 84 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Bounds for the Zero-Forcing Number of Graphs with Large Girth
Randy Davila, Franklin Kenter
We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, where is the minimum degree, in the triangle-free case. In parti…
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…