Caleb C. Fast

most citedLower Bounds on the Distance Domination Number of a Graph

4 citations · 6 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DM2017

Computational Approaches for Zero Forcing and Related Problems

Boris Brimkov, Caleb C. Fast, Illya V. Hicks

In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of…

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…

math.CO2015★ 4 cited

Lower Bounds on the Distance Domination Number of a Graph

Randy Davila, Caleb Fast, Michael Henning +1

For an integer $k \geq 1$ , a (distance) $k$ -dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V (G) ∖ S$ is at distance at mo…