| Upper bounds on the k-forcing number of a graph D Amos, Y Caro, R Davila, R Pepper Discrete Applied Mathematics 181, 1-10, 2015 | 98 | 2015 |
| Bounds for the zero-forcing number of graphs with large girth R Davila, F Kenter Theory and Applications of Graphs 2 (1), 2015 | 47 | 2015 |
| A lower bound on the zero forcing number R Davila, T Kalinowski, S Stephen Discrete Applied Mathematics 250, 363-367, 2018 | 44 | 2018 |
| On the total forcing number of a graph R Davila, MA Henning Discrete Applied Mathematics 257, 115-127, 2019 | 32 | 2019 |
| Bounds on the connected forcing number of a graph R Davila, MA Henning, C Magnant, R Pepper Graphs and Combinatorics 34, 1159-1174, 2018 | 32 | 2018 |
| Lower bounds on the distance domination number of a graph R Davila, C Fast, M Henning, F Kenter Contributions to Discrete Mathematics 12 (2), 11-21, 2015 | 30 | 2015 |
| Bounding the forcing number of a graph RR Davila Rice University, 2015 | 27 | 2015 |
| Zero forcing in claw-free cubic graphs R Davila, MA Henning Bulletin of the Malaysian Mathematical Sciences Society 43 (1), 673-688, 2020 | 25 | 2020 |
| Total forcing versus total domination in cubic graphs R Davila, MA Henning Applied Mathematics and Computation 354, 385-395, 2019 | 22 | 2019 |
| The forcing number of graphs with given girth R Davila, MA Henning Quaestiones Mathematicae 41 (2), 189-204, 2018 | 21 | 2018 |
| Characterizations of the connected forcing number of a graph B Brimkov, R Davila arXiv preprint arXiv:1604.00740, 2016 | 20 | 2016 |
| A Vizing-type result for semi-total domination J Asplund, R Davila, E Krop Discrete Applied Mathematics 258, 8-12, 2019 | 18 | 2019 |
| Total forcing and zero forcing in claw-free cubic graphs R Davila, MA Henning Graphs and Combinatorics 34, 1371-1384, 2018 | 18 | 2018 |
| Zero forcing versus domination in cubic graphs R Davila, MA Henning Journal of Combinatorial Optimization 41 (2), 553-577, 2021 | 13 | 2021 |
| Bounds for the zero forcing number of graphs with large girth, Theory Appl R Davila, F Kenter Graphs 2, 1-10, 2015 | 12 | 2015 |
| Total forcing sets and zero forcing sets in trees R Davila, MA Henning Discussiones Mathematicae Graph Theory 40 (3), 733-754, 2020 | 11 | 2020 |
| Conjectures of TxGraffiti: Independence, domination, and matchings Y Caro, R Davila, M Henning, R Pepper Australasian Journal of Combinatorics 84 (2), 258-274, 2021 | 10 | 2021 |
| New results relating independence and matchings Y Caro, R Davila, R Pepper arXiv preprint arXiv:1909.09093, 2019 | 9 | 2019 |
| Computer assisted discovery: Zero forcing vs vertex cover B Brimkov, R Davila, H Schuerger, M Young arXiv preprint arXiv:2209.04552, 2022 | 8 | 2022 |
| On the k-residue of disjoint unions of graphs with applications to k-independence D Amos, R Davila, R Pepper Discrete Mathematics 321, 24-34, 2014 | 7 | 2014 |
Michael A. HenningProfessor of Mathematics, University of JohannesburgVerifisert e-postadresse på uj.ac.za