default search action
Randy Davila
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young:
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs. Discret. Appl. Math. 359: 290-302 (2024) - [i7]Randy Davila:
Artificial intelligence and machine learning generated conjectures with TxGraffiti. CoRR abs/2407.02731 (2024) - [i6]Randy Davila:
Estimating the stability number of a random graph using convolutional neural networks. CoRR abs/2407.07827 (2024) - [i5]Randy Davila:
Automated conjecturing in mathematics with TxGraffiti. CoRR abs/2409.19379 (2024) - 2023
- [j15]Randy Davila, Michael A. Henning, Ryan Pepper:
Zero and total forcing dense graphs. Discuss. Math. Graph Theory 43(3): 619-634 (2023) - 2022
- [j14]Yair Caro, Randy Davila, Ryan Pepper:
New results relating inependence and matchings. Discuss. Math. Graph Theory 42(3): 921-935 (2022) - 2021
- [j13]Randy Davila, Michael A. Henning:
Zero forcing versus domination in cubic graphs. J. Comb. Optim. 41(2): 553-577 (2021) - 2020
- [j12]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The Slater and sub-k-domination number of a graph with applications to domination and k-domination. Discuss. Math. Graph Theory 40(1): 209-225 (2020) - [j11]Randy Davila, Michael A. Henning:
Total forcing sets and zero forcing sets in trees. Discuss. Math. Graph Theory 40(3): 733-754 (2020)
2010 – 2019
- 2019
- [j10]Randy Davila, Michael A. Henning:
Total forcing versus total domination in cubic graphs. Appl. Math. Comput. 354: 385-395 (2019) - [j9]Randy Davila, Michael A. Henning:
On the total forcing number of a graph. Discret. Appl. Math. 257: 115-127 (2019) - [j8]John Asplund, Randy Davila, Elliot Krop:
A Vizing-type result for semi-total domination. Discret. Appl. Math. 258: 8-12 (2019) - [j7]Yair Caro, Randy Davila, Ryan Pepper:
Extremal k-forcing sets in oriented graphs. Discret. Appl. Math. 262: 42-55 (2019) - 2018
- [j6]Randy Davila, Thomas Kalinowski, Sudeep Stephen:
A lower bound on the zero forcing number. Discret. Appl. Math. 250: 363-367 (2018) - [j5]Randy Davila, Michael A. Henning, Colton Magnant, Ryan Pepper:
Bounds on the Connected Forcing Number of a Graph. Graphs Comb. 34(6): 1159-1174 (2018) - [j4]Randy Davila, Michael A. Henning:
Total Forcing and Zero Forcing in Claw-Free Cubic Graphs. Graphs Comb. 34(6): 1371-1384 (2018) - 2017
- [j3]Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter:
Lower Bounds on the Distance Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - 2016
- [i4]Boris Brimkov, Randy Davila:
Characterizations of the Connected Forcing Number of a Graph. CoRR abs/1604.00740 (2016) - [i3]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The sub-$k$-domination number of a graph with applications to $k$-domination. CoRR abs/1611.02379 (2016) - [i2]Randy Davila, Thomas Kalinowski, Sudeep Stephen:
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. CoRR abs/1611.06557 (2016) - 2015
- [j2]David Amos, Yair Caro, Randy Davila, Ryan Pepper:
Upper bounds on the k-forcing number of a graph. Discret. Appl. Math. 181: 1-10 (2015) - 2014
- [j1]David Amos, Randy Davila, Ryan Pepper:
On the k-residue of disjoint unions of graphs with applications to k-independence. Discret. Math. 321: 24-34 (2014) - [i1]Randy Davila, Franklin Kenter:
Bounds for the Zero-Forcing Number of Graphs with Large Girth. CoRR abs/1406.0482 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint