Randy Davila

activity

20142023

most citedA lower bound on the zero forcing number

36 citations · 84 across the 13 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 15 cited

A Vizing-type result for semi-total domination

John Asplund, Randy Davila, Elliot Krop

A set of vertices $S$ in a simple isolate-free graph $G$ is a semi-total dominating set of $G$ if it is a dominating set of $G$ and every vertex of $S$ is within distance 2 or less…

math.CO2018

Zero Forcing in Claw-Free Cubic Graphs

Randy Davila, Michael Henning

The zero forcing number of a simple graph, written $Z (G)$ , is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been hea…

math.CO2018

Matching, Path Covers, and Total Forcing Sets

Randy Davila, Michael Henning

A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…