10 citations · 12 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Maximum oriented forcing number for complete graphs
Yair Caro, Ryan Pepper
The maximum oriented -forcing number of a simple graph , written $\MOF_k(G)$, is the maximum directed -forcing number among all orientations of . This invariant was rec…
math.CO2017★ 1 cited
Extremal -forcing sets in oriented graphs
Yair Caro, Randy Davila, Ryan Pepper
This article studies the \emph{-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the -forcing number for simple g…