3 citations · 5 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
Total Forcing and Zero Forcing in Claw-Free Cubic Graphs
Randy Davila, Michael Henning
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…
On the Total Forcing Number of a Graph
Randy Davila, Michael A. Henning
Let be a simple and finite graph without isolated vertices. In this paper we study forcing sets (zero forcing sets) which induce a subgraph of without isolated vertices. Su…
Total Forcing Sets in Trees
Randy Davila, Michael Henning
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…
A note on sub-total domination in graphs
Randy Davila
Let be a simple and finite graph without isolated vertices. In this paper we introduce and study a new degree sequence derived invariant called the \emph{sub-total domination n…