Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Daniela Ferrero"'
Publikováno v:
Historia Regional, Iss 24, Pp 151-171 (2018)
El presente trabajo tiene como objetivo central analizar el testimonio oral de uno de los sujetos que protagonizaron aquél acontecimiento histórico tan impactante y trascendente para la sociedad boliviana, tal como lo fue el conflicto bélico por e
Externí odkaz:
https://doaj.org/article/cd5e6d832db945df91e13a158b989f33
Publikováno v:
Discrete Applied Mathematics. 255: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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9e5223a9d0e0917f471ed7e69a9f693
https://doi.org/10.1016/j.dam.2018.08.019
https://doi.org/10.1016/j.dam.2018.08.019
Autor:
Veronika Furst, Mary Flagg, Leslie Hogben, Daniela Ferrero, Katherine F. Benson, Violeta Vasilevska
Publikováno v:
Discrete Applied Mathematics. 251:103-113
A power dominating set of a graph G is a set S of vertices that can observe the entire graph under the rules that (1) the closed neighborhood of every vertex in S is observed, and (2) if a vertex and all but one of its neighbors are observed, then th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::147a80adbc5f67f43ad88b7de2ab177f
https://doi.org/10.1016/j.dam.2018.06.004
https://doi.org/10.1016/j.dam.2018.06.004
Autor:
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero, Leslie Hogben, Carolyn Mayer, Ann N. Trenk, Shanise Walker
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35087f60b50e1664426c75101eacbf7a
https://doi.org/10.1007/978-3-030-77983-2_2
https://doi.org/10.1007/978-3-030-77983-2_2
Autor:
Daniela Ferrero, Sarah Anderson, Karen Collins, Leslie Hogben, Carolyn Mayer, Ann Trenk, Walker Shanise
Publikováno v:
Proposed for presentation at the Joint Mathematics Meeting held January 6-9, 2021..
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e9317035c131c980c78eef3ec17eeba
https://doi.org/10.2172/1839518
https://doi.org/10.2172/1839518
Publikováno v:
Journal of Combinatorial Optimization. 37:970-988
Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related to the minimum rank problem. The minimum rank of a graph is the smallest possible rank over all matrices described by a gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::caa741126c6af89752b44798a645e423
https://doi.org/10.1007/s10878-018-0335-1
https://doi.org/10.1007/s10878-018-0335-1
Publikováno v:
Journal of Combinatorial Optimization. 37:935-956
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::8851b3dd5f99a7c8769b49b21520ae9d
https://doi.org/10.1007/s10878-018-0330-6
https://doi.org/10.1007/s10878-018-0330-6
Publikováno v:
Discrete Mathematics. 341:1789-1797
Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe the entire graph using th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d2edb7d3ca290bdcaacbe6e7e737ddf
https://doi.org/10.1016/j.disc.2017.10.031
https://doi.org/10.1016/j.disc.2017.10.031
The Workshop for Women in Graph Theory and Applications was held at the Institute for Mathematics and Its Applications (University of Minnesota, Minneapolis) on August 19-23, 2019. During this five-day workshop, 42 participants performed collaborativ
Publikováno v:
Journal of Combinatorial Optimization. 34:736-741
We present a counterexample to a lower bound for the power domination number given in Liao (J Comb Optim 31:725–742, 2016). We also define the power propagation time, using the power domination propagation ideas in Liao and the (zero forcing) propa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::436e66b277d8eecff053a7aa80431b2a
https://doi.org/10.1007/s10878-016-0103-z
https://doi.org/10.1007/s10878-016-0103-z