The following pages link to Randy Davila (Q394538):
Displayed 25 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)
- Characterizations of the Connected Forcing Number of a Graph (Q6272172) (← links)
- A note on sub-total domination in graphs (Q6282479) (← links)
- Total Forcing Sets in Trees (Q6283454) (← links)
- Computer assisted discovery: Zero forcing vs vertex cover (Q6410251) (← links)
- Advancements in Research Mathematics through AI: A Framework for Conjecturing (Q6441121) (← links)