36 citations · 84 across the 13 of their papers we have counts for
21 papers
Advancements in Research Mathematics through AI: A Framework for Conjecturing
Randy Davila
In the words of the esteemed mathematician Paul Erdös, the mathematician's task is to \emph{prove and conjecture}. These two processes form the bedrock of all mathematical endeavou…
Computer assisted discovery: Zero forcing vs vertex cover
Boris Brimkov, Randy Davila, Houston Schuerger +1
In this paper, we showcase the process of using an automated conjecturing program called \emph{TxGraffiti} written and maintained by the second author. We begin by proving a conjec…
Conjecture of TxGraffiti: Independence, domination, and matchings
Yair Caro, Randy Davila, Michael Henning +1
TxGraffiti is an automated conjecturing program that produces graph theoretic conjectures in the form of conjectured inequalities. This program written and maintained by the second…
New results relating independence and matchings
Yair Caro, Randy Davila, Ryan Pepper
In this paper we study relationships between the \emph{matching number}, written , and the \emph{independence number}, written . Our first main result is to show \[ α(G…
A Vizing-type result for semi-total domination
John Asplund, Randy Davila, Elliot Krop
A set of vertices in a simple isolate-free graph is a semi-total dominating set of if it is a dominating set of and every vertex of is within distance 2 or less…
Zero Forcing in Claw-Free Cubic Graphs
Randy Davila, Michael Henning
The zero forcing number of a simple graph, written , is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been hea…