Randy Davila
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Randy Davila has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Michael A. Henning
Department of Mathematics and Applied Mathematics University of Johannesburg Auckland Park South Africa
8 shared publications Ryan Pepper
8 shared publications- Elliot Krop
Department of Mathematics Clayton State University
4 shared publications Yair Caro
4 shared publicationsBoris Brimkov
3 shared publicationsDavid Amos
3 shared publications
Latest Publications
- 14 April 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 94 (4) , 1-24
Automated conjecturing with TxGraffiti
- 14 April 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 94 (4) , 1-24
Automated conjecturing with TxGraffiti
- Open Access
- 23 February 2026
- Published by Elsevier in SSRN Electronic Journal
Connected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs --- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
- 23 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessConnected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs --- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
- Open Access
- 19 January 2026
- Published by Springer Nature in Research Square
Graffiti3 : Compact Theory Libraries for Automated Mathematical Discovery
We study automated conjecturing: the computer-assisted generation of human-readable symbolic statements intended for expert inspection and subsequent proof or refutation. We formalize conjecture generation as theory selection over a finite, evolving evidence base represented by a streaming invariant table, whose rows (objects) and columns (invariants, predicates, and derived features) expand as new constructions and counterexamples are discovered. We present Graffiti3 , a domain-agnostic engine that converts such tables into a compact theory library: a budgeted, nonredundant set of snapshot-true bounds, implications, and structural annotations drawn from a controlled grammar. Candidate statements are produced by optimization and then filtered and ranked by explicit simplicity criteria together with dominance-style redundancy elimination, yielding a small library designed for iterative questioning, counterexample search, and downstream deductive work. To support such reasoning, Graffiti3 augments conjectures with short sufficient conditions that explain equality and near-equality regimes, exhaustively verifies each output in the current snapshot, and treats conjectures as provisional until they survive targeted counterexample search or are proved. We also describe a hybrid workflow in which a large language model proposes derived features and narrative summaries while Graffiti3 provides deterministic validation and theory selection. In integer arithmetic, we prove two conjectures produced by this workflow, yielding characterizations of squarefree integers. We demonstrate the methodology on finite groups, knot theory, and a Calabi–Yau hypersurface census, and we revisit graph-theoretic conjectures from the predecessor system TxGraffiti, recalling open problems and reporting new ones.
- 19 January 2026
- Published by Springer Nature in Research Square
Open AccessGraffiti3 : Compact Theory Libraries for Automated Mathematical Discovery
We study automated conjecturing: the computer-assisted generation of human-readable symbolic statements intended for expert inspection and subsequent proof or refutation. We formalize conjecture generation as theory selection over a finite, evolving evidence base represented by a streaming invariant table, whose rows (objects) and columns (invariants, predicates, and derived features) expand as new constructions and counterexamples are discovered. We present Graffiti3 , a domain-agnostic engine that converts such tables into a compact theory library: a budgeted, nonredundant set of snapshot-true bounds, implications, and structural annotations drawn from a controlled grammar. Candidate statements are produced by optimization and then filtered and ranked by explicit simplicity criteria together with dominance-style redundancy elimination, yielding a small library designed for iterative questioning, counterexample search, and downstream deductive work. To support such reasoning, Graffiti3 augments conjectures with short sufficient conditions that explain equality and near-equality regimes, exhaustively verifies each output in the current snapshot, and treats conjectures as provisional until they survive targeted counterexample search or are proved. We also describe a hybrid workflow in which a large language model proposes derived features and narrative summaries while Graffiti3 provides deterministic validation and theory selection. In integer arithmetic, we prove two conjectures produced by this workflow, yielding characterizations of squarefree integers. We demonstrate the methodology on finite groups, knot theory, and a Calabi–Yau hypersurface census, and we revisit graph-theoretic conjectures from the predecessor system TxGraffiti, recalling open problems and reporting new ones.
- Open Access
Graph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction
We investigate machine learning approaches to approximating the \emph{domination number} of graphs, the minimum size of a dominating set. Exact computation of this parameter is NP-hard, restricting classical methods to small instances. We compare two neural paradigms: Convolutional Neural Networks (CNNs), which operate on adjacency matrix representations, and Graph Neural Networks (GNNs), which learn directly from graph structure through message passing. Across 2,000 random graphs with up to 64 vertices, GNNs achieve markedly higher accuracy ($R^2=0.987$, MAE $=0.372$) than CNNs ($R^2=0.955$, MAE $=0.500$). Both models offer substantial speedups over exact solvers, with GNNs delivering more than $200\times$ acceleration while retaining near-perfect fidelity. Our results position GNNs as a practical surrogate for combinatorial graph invariants, with implications for scalable graph optimization and mathematical discovery.Open AccessGraph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction
We investigate machine learning approaches to approximating the \emph{domination number} of graphs, the minimum size of a dominating set. Exact computation of this parameter is NP-hard, restricting classical methods to small instances. We compare two neural paradigms: Convolutional Neural Networks (CNNs), which operate on adjacency matrix representations, and Graph Neural Networks (GNNs), which learn directly from graph structure through message passing. Across 2,000 random graphs with up to 64 vertices, GNNs achieve markedly higher accuracy ($R^2=0.987$, MAE $=0.372$) than CNNs ($R^2=0.955$, MAE $=0.500$). Both models offer substantial speedups over exact solvers, with GNNs delivering more than $200\times$ acceleration while retaining near-perfect fidelity. Our results position GNNs as a practical surrogate for combinatorial graph invariants, with implications for scalable graph optimization and mathematical discovery. - Open Access
- 23 August 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (112) , 8383
GraphCalc: A Python Package for Computing Graph Invariants in Automated Conjecturing Systems
GraphCalc is a Python library for computing an extensive collection of graph-theoretic invariants, designed to support research in combinatorics, network science, and automated reasoning. It implements more than 100 exact functions, covering classical measures (e.g., independence number, chromatic number, spectral radius) and many lesser-known invariants central to extremal graph theory and domination theory.
- 23 August 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (112) , 8383
Open AccessGraphCalc: A Python Package for Computing Graph Invariants in Automated Conjecturing Systems
GraphCalc is a Python library for computing an extensive collection of graph-theoretic invariants, designed to support research in combinatorics, network science, and automated reasoning. It implements more than 100 exact functions, covering classical measures (e.g., independence number, chromatic number, spectral radius) and many lesser-known invariants central to extremal graph theory and domination theory.
- Open Access
Connected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
Open AccessConnected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
- 19 May 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 373, 316-326
Comparing the -independence number of regular graphs to the -independence number of their line graphs- 19 May 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 373, 316-326
Comparing the -independence number of regular graphs to the -independence number of their line graphs- Open Access
- 1 January 2025
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 12 (1) , 6
Lower Bounds for the Total Distance $k$-Domination Number of a Graph
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself. The \emph{total distance $k$-domination number} of $G$ is the minimum cardinality of a total $k$-dominating set in $G$ and is denoted by $\gamma_{k}^t(G)$. When $k=1$, the total $k$-domination number reduces to the \emph{total domination number}, written $\gamma_t(G)$; that is, $\gamma_t(G) = \gamma_{1}^t(G)$. This paper shows that several known lower bounds on the total domination number generalize nicely to lower bounds on total distance $k$-domination.- 1 January 2025
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 12 (1) , 6
Open AccessLower Bounds for the Total Distance $k$-Domination Number of a Graph
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself. The \emph{total distance $k$-domination number} of $G$ is the minimum cardinality of a total $k$-dominating set in $G$ and is denoted by $\gamma_{k}^t(G)$. When $k=1$, the total $k$-domination number reduces to the \emph{total domination number}, written $\gamma_t(G)$; that is, $\gamma_t(G) = \gamma_{1}^t(G)$. This paper shows that several known lower bounds on the total domination number generalize nicely to lower bounds on total distance $k$-domination. - Open Access
- 13 December 2024
- Published by Springer Nature in Research Square
The Optimist: Towards Fully AutomatedGraph Theory Research
This paper introduces the Optimist, an autonomous system developed to advanceautomated conjecture generation in graph theory. Leveraging mixed-integer pro-gramming (MIP) and heuristic methods, the Optimist generates conjectures thatboth rediscover established theorems and propose novel inequalities. Througha combination of memory-based computation and agent-like adaptability, theOptimist iteratively refines its conjectures by integrating new data, enabling afeedback process with minimal human (or machine) intervention. Initial exper-iments reveal the Optimist’s potential to uncover foundational results in graphtheory, as well as to produce conjectures of interest for future exploration. Thiswork also outlines the Optimist’s evolving integration with a counterpart agent,the Pessimist (a human or machine agent), to establish a dueling system thatwill drive fully automated graph theory research.
- 13 December 2024
- Published by Springer Nature in Research Square
Open AccessThe Optimist: Towards Fully AutomatedGraph Theory Research
This paper introduces the Optimist, an autonomous system developed to advanceautomated conjecture generation in graph theory. Leveraging mixed-integer pro-gramming (MIP) and heuristic methods, the Optimist generates conjectures thatboth rediscover established theorems and propose novel inequalities. Througha combination of memory-based computation and agent-like adaptability, theOptimist iteratively refines its conjectures by integrating new data, enabling afeedback process with minimal human (or machine) intervention. Initial exper-iments reveal the Optimist’s potential to uncover foundational results in graphtheory, as well as to produce conjectures of interest for future exploration. Thiswork also outlines the Optimist’s evolving integration with a counterpart agent,the Pessimist (a human or machine agent), to establish a dueling system thatwill drive fully automated graph theory research.
- Open Access
The \emph{Optimist}: Towards Fully Automated Graph Theory Research
This paper introduces the \emph{Optimist}, an autonomous system developed to advance automated conjecture generation in graph theory. Leveraging mixed-integer programming (MIP) and heuristic methods, the \emph{Optimist} generates conjectures that both rediscover established theorems and propose novel inequalities. Through a combination of memory-based computation and agent-like adaptability, the \emph{Optimist} iteratively refines its conjectures by integrating new data, enabling a feedback process with minimal human (\emph{or machine}) intervention. Initial experiments reveal the \emph{Optimist}'s potential to uncover foundational results in graph theory, as well as to produce conjectures of interest for future exploration. This work also outlines the \emph{Optimist}'s evolving integration with a counterpart agent, the \emph{Pessimist} (a human \emph{or machine} agent), to establish a dueling system that will drive fully automated graph theory research.
Open AccessThe \emph{Optimist}: Towards Fully Automated Graph Theory Research
This paper introduces the \emph{Optimist}, an autonomous system developed to advance automated conjecture generation in graph theory. Leveraging mixed-integer programming (MIP) and heuristic methods, the \emph{Optimist} generates conjectures that both rediscover established theorems and propose novel inequalities. Through a combination of memory-based computation and agent-like adaptability, the \emph{Optimist} iteratively refines its conjectures by integrating new data, enabling a feedback process with minimal human (\emph{or machine}) intervention. Initial experiments reveal the \emph{Optimist}'s potential to uncover foundational results in graph theory, as well as to produce conjectures of interest for future exploration. This work also outlines the \emph{Optimist}'s evolving integration with a counterpart agent, the \emph{Pessimist} (a human \emph{or machine} agent), to establish a dueling system that will drive fully automated graph theory research.