Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Randy Davila"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 3, p 619 (2023)
Externí odkaz:
https://doaj.org/article/4d1fc8a8762540358228475419bc330c
Autor:
Elliot Krop, Randy Davila
Publikováno v:
Theory and Applications of Graphs, Vol 7 (2020)
Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a functio
Externí odkaz:
https://doaj.org/article/a8c4c4984a614ffabcfb85feecb5a8ad
Autor:
Randy Davila, Franklin Kenter
Publikováno v:
Theory and Applications of Graphs, Vol 2, Iss 2 (2015)
The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Z(G) where δ is the minimum degree. An improvement of this bound is prov
Externí odkaz:
https://doaj.org/article/ca24cc4369c64d16acf9c3bae72089e3
Autor:
Randy Davila, Michael A. Henning
Publikováno v:
Journal of Combinatorial Optimization. 41:553-577
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-col
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0bf0714c25b0443f6f0620e1c7496a6
https://doi.org/10.1007/s10878-020-00692-z
https://doi.org/10.1007/s10878-020-00692-z
Autor:
Randy Davila, Michael A. Henning
Publikováno v:
Applied Mathematics and Computation. 354:385-395
A set S of vertices in a graph G is a total dominating set of G if every vertex has a neighbor in S. The total domination number, γt(G), is the minimum cardinality of a total dominating set of G. A total forcing set in a graph G is a forcing set (ze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7947bd236e66988ec99efe943fd00ae3
https://doi.org/10.1016/j.amc.2019.02.060
https://doi.org/10.1016/j.amc.2019.02.060
Publikováno v:
Discrete Applied Mathematics. 262:42-55
This article studies the k -forcing number for oriented graphs, generalizing both the zero forcing number for directed graphs and the k -forcing number for simple graphs. In particular, given a simple graph G , we introduce the maximum (minimum) orie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e09cbb00cdb1ec8a3ec4b49fdeba7da
https://doi.org/10.1016/j.dam.2019.02.004
https://doi.org/10.1016/j.dam.2019.02.004
Autor:
Michael A. Henning, Randy Davila
Publikováno v:
Discrete Applied Mathematics. 257:115-127
A total forcing set in a graph G is a forcing set (zero forcing set) in G which induces a subgraph without isolated vertices. Total forcing sets were introduced and first studied by Davila (2015). The total forcing number of G , denoted F t ( G ) is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86d6fbcd78eb6ad6432685837f4cf43a
https://doi.org/10.1016/j.dam.2018.09.001
https://doi.org/10.1016/j.dam.2018.09.001
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fba6ce4850369f01063d9838dfca59fa
https://doi.org/10.7151/dmgt.2389
https://doi.org/10.7151/dmgt.2389
Autor:
Randy Davila, Michael A. Henning
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 43:673-688
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial subset S of colored vertices, with all remaining vertices being uncolored. At each discrete time interval, a colored vertex with exactly one uncolored
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7462f179cd2560397660b66d41740652
https://doi.org/10.1007/s40840-018-00705-5
https://doi.org/10.1007/s40840-018-00705-5
Publikováno v:
Graphs and Combinatorics. 34:1159-1174
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected forcing numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a01f4c80388ceaea6c42a70051ae0909
https://doi.org/10.1007/s00373-018-1957-x
https://doi.org/10.1007/s00373-018-1957-x