The following pages link to Randy Davila (Q394538):
Displaying 30 items.
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- A Vizing-type result for semi-total domination (Q1732092) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Lower Bounds on the Distance Domination Number of a Graph (Q4598363) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- On a Vizing-type Integer Domination Conjecture (Q5113453) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- Bounds for the Zero Forcing Number of Graphs with Large Girth (Q5225511) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
- Lower bounds for the total (distance) $k$-domination number of a graph (Q6732432) (← links)
- Another conjecture of TxGraffiti concerning zero forcing and domination in graphs (Q6734264) (← links)
- Artificial intelligence and machine learning generated conjectures with TxGraffiti (Q6734978) (← links)
- Estimating the stability number of a random graph using convolutional neural networks (Q6736031) (← links)
- Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs (Q6743138) (← links)
- Automated conjecturing in mathematics with \emph{TxGraffiti} (Q6746511) (← links)
- The \emph{Optimist}: Towards Fully Automated Graph Theory Research (Q6753399) (← links)
- A Characterization of Claw-Free Graphs using Zero Forcing Invariants (Q6756591) (← links)
- Independence, induced subgraphs, and domination in $K_{1,r}$-free graphs (Q6761720) (← links)
