3 citations · 5 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Bounds on the connected forcing number of a graph
Randy Davila, Michael Henning, Colton Magnant +1
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph.…
cs.DM2016
Characterizations of the Connected Forcing Number of a Graph
Boris Brimkov, Randy Davila
Zero forcing is a dynamic graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. This forcing process has been used to…