2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
Deduction, Constrained Zero Forcing, and Constrained Searching
Andrea Burgess, Danny Dyer, Kerry Ojakian +3
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…
math.CO2014★ 2 cited
On the Complexity of the Positive Semidefinite Zero Forcing Number
Shaun Fallat, Karen Meagher, Boting Yang
The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero f…