Randy Davila

28 papers Journal 28
YearRankTypeTitle / Venue / Authors
2025 J jnl
Comparing the p-independence number of regular graphs to the q-independence number of their line graphs.
Discret. Appl. Math.
Yair Caro, Randy Davila, Ryan Pepper
2025 J jnl
Graph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction.
CoRR
Randy Davila, Beyzanur Ispir
2025 J jnl
GraphCalc: A Python Package for Computing Graph Invariants in Automated Conjecturing Systems.
J. Open Source Softw.
Randy Davila
2025 J jnl
In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator.
CoRR
Randy Davila, Boris Brimkov, Ryan Pepper
2024 J jnl
Artificial intelligence and machine learning generated conjectures with TxGraffiti.
CoRR
Randy Davila
2024 J jnl
Automated conjecturing in mathematics with TxGraffiti.
CoRR
Randy Davila
2024 J jnl
Estimating the stability number of a random graph using convolutional neural networks.
CoRR
Randy Davila
2024 J jnl
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs.
Discret. Appl. Math.
Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young
2024 J jnl
The Optimist: Towards Fully Automated Graph Theory Research.
CoRR
Randy Davila
2023 J jnl
Zero and total forcing dense graphs.
Discuss. Math. Graph Theory
Randy Davila, Michael A. Henning, Ryan Pepper
2022 J jnl
New results relating inependence and matchings.
Discuss. Math. Graph Theory
Yair Caro, Randy Davila, Ryan Pepper
2021 J jnl
Zero forcing versus domination in cubic graphs.
J. Comb. Optim.
Randy Davila, Michael A. Henning
2020 J jnl
The Slater and sub-
Discuss. Math. Graph Theory
David Amos, John Asplund, Boris Brimkov, Randy Davila
2020 J jnl
Total forcing sets and zero forcing sets in trees.
Discuss. Math. Graph Theory
Randy Davila, Michael A. Henning
2019 J jnl
A Vizing-type result for semi-total domination.
Discret. Appl. Math.
John Asplund, Randy Davila, Elliot Krop
2019 J jnl
Extremal k-forcing sets in oriented graphs.
Discret. Appl. Math.
Yair Caro, Randy Davila, Ryan Pepper
2019 J jnl
On the total forcing number of a graph.
Discret. Appl. Math.
Randy Davila, Michael A. Henning
2019 J jnl
Total forcing versus total domination in cubic graphs.
Appl. Math. Comput.
Randy Davila, Michael A. Henning
2018 J jnl
A lower bound on the zero forcing number.
Discret. Appl. Math.
Randy Davila, Thomas Kalinowski, Sudeep Stephen
2018 J jnl
Bounds on the Connected Forcing Number of a Graph.
Graphs Comb.
Randy Davila, Michael A. Henning, Colton Magnant, Ryan Pepper
2018 J jnl
Total Forcing and Zero Forcing in Claw-Free Cubic Graphs.
Graphs Comb.
Randy Davila, Michael A. Henning
2017 J jnl
Lower Bounds on the Distance Domination Number of a Graph.
Contributions Discret. Math.
Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter
2016 J jnl
Characterizations of the Connected Forcing Number of a Graph.
CoRR
Boris Brimkov, Randy Davila
2016 J jnl
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree.
CoRR
Randy Davila, Thomas Kalinowski, Sudeep Stephen
2016 J jnl
The sub-$k$-domination number of a graph with applications to $k$-domination.
CoRR
David Amos, John Asplund, Boris Brimkov, Randy Davila
2015 J jnl
Upper bounds on the k-forcing number of a graph.
Discret. Appl. Math.
David Amos, Yair Caro, Randy Davila, Ryan Pepper
2014 J jnl
Bounds for the Zero-Forcing Number of Graphs with Large Girth.
CoRR
Randy Davila, Franklin Kenter
2014 J jnl
On the k-residue of disjoint unions of graphs with applications to k-independence.
Discret. Math.
David Amos, Randy Davila, Ryan Pepper