Deduction, Constrained Zero Forcing, and Constrained Searching
Deduction, Constrained Zero Forcing, and Constrained Searching
Deduction is a recently introduced graph searching process in which searchers clear the vertex set of a graph with one move each, with each searcher's movement determined by which of its neighbors are protected by other searchers. In this paper, we show that the minimum number of searchers required to …