2 citations · 2 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017★ 2 cited
Graphs with Extremal Connected Forcing Numbers
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The…
cs.DM2016
Complexity and Computation of Connected Zero Forcing
Boris Brimkov
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum ze…