Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Ferrero, Daniela"'
Autor:
Bjorkman, Beth, Bozeman, Chassidy, Ferrero, Daniela, Flagg, Mary, Grood, Cheryl, Hogben, Leslie, Jacob, Bonnie, Reinhart, Carolyn
The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs for other pa
Externí odkaz:
http://arxiv.org/abs/2201.01798
Autor:
Anderson, Sarah E., Collins, Karen L., Ferrero, Daniela, Hogben, Leslie, Mayer, Carolyn, Trenk, Ann N., Walker, Shanise
Throttling addresses the question of minimizing the sum or the product of the resources used to accomplish a task and the time needed to complete that task for various graph searching processes. Graph parameters of interest include various types of z
Externí odkaz:
http://arxiv.org/abs/2012.12807
Autor:
Anderson, Sarah E., Collins, Karen L., Ferrero, Daniela, Hogben, Leslie, Mayer, Carolyn, Trenk, Ann N., Walker, Shanise
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two parameters are equa
Externí odkaz:
http://arxiv.org/abs/2010.16315
Autor:
Ferrero, Daniela, Flagg, Mary, Hall, H. Tracy, Hogben, Leslie, Lin, Jephian C. -H., Meyer, Seth, Nasserasr, Shahla, Shader, Bryan
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning r
Externí odkaz:
http://arxiv.org/abs/1808.05553
Autor:
Boyer, Kirk, Brimkov, Boris, English, Sean, Ferrero, Daniela, Keller, Ariel, Kirsch, Rachel, Phillips, Michael, Reinhart, Carolyn
Publikováno v:
Discrete Applied Mathematics, Volume 258, 2019, Pages 35-48, ISSN 0166-218X
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices
Externí odkaz:
http://arxiv.org/abs/1801.08910
Autor:
Ferrero, Daniela, Lesniak, Linda
We prove that for any integers $p\geq k\geq 3$ and any $k$-tuple of positive integers $(n_1,\ldots ,n_k)$ such that $p=\sum _{i=1}^k{n_i}$ and $n_1\geq n_2\geq \ldots \geq n_k$, the condition $n_1\leq {p\over 2}$ is necessary and sufficient for every
Externí odkaz:
http://arxiv.org/abs/1801.07854
Autor:
Bozeman, Chassidy, Brimkov, Boris, Erickson, Craig, Ferrero, Daniela, Flagg, Mary, Hogben, Leslie
Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in the graph,
Externí odkaz:
http://arxiv.org/abs/1711.05190
Publikováno v:
Discrete Applied Mathematics 255 (2019), 198-208
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line dig
Externí odkaz:
http://arxiv.org/abs/1708.03398