1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
On broadcast domination of directed graphs
Pamela E. Harris, Peter Hollander, Erik Insko
A dominating set of a graph is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of is the order of a minimum dominati…
math.CO2020
Throttling for standard zero forcing on directed graphs
Emily Cairncross, Joshua Carlson, Peter Hollander +3
Zero forcing is a process on graphs in which a color change rule is used to force vertices to become blue. The amount of time taken for all vertices in the graph to become blue is…