DFDaniela Ferrero

Daniela Ferrero

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Daniela Ferrero has a total of 70 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Power Domination Reconfiguration

    by Beth Bjorkman, Chassidy Bozeman, Daniela Ferrero, Mary Flagg, Cheryl Grood, Leslie Hogben, Bonnie Jacob, Carolyn Reinhart

    Reconfiguration examines relationships among solutions to a problem. Power domination models placement of monitoring units that allow monitoring of an entire electrical power network, and information about modifying one monitoring solution to another has applications. 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 parameters. A universal framework for the study of reconfiguration of parameters that are defined from sets of vertices of a graph and satisfy certain rules is introduced. This allows application of some of the results to additional parameters such as domination and zero forcing.


  • Open Access

    Zero forcing propagation time intervals and graphs with fixed propagation time

    by Daniela Ferrero, H. Tracy Hall, Leslie Hogben, Mark Hunnell, Ben Small

    Zero forcing in a graph refers to the evolution of vertex states under repeated application of a color change rule. Typically the states are chosen to be blue and white, and a forcing set is an initial set of blue vertices such that all of the vertices are blue at the end of the process. In this context, the propagation time of a set in a graph is the number of iterations of the color change rule required to have all vertices blue, performing independent color changes simultaneously. Different minimal forcing sets need not have the same propagation time, and we study the realizability of specific integers as propagation times of minimal forcing sets in graphs for two of the most well-studied color change rules (standard and positive semidefinite). Particular attention is paid to the case where all minimal forcing sets have the same propagation time, and we term this phenomenon fixed propagation time. For each of the two variants, we present a general form of graphs all of which have fixed propagation time equal to one. We conjecture that these are the only such graphs and prove the conjectures for joins of graphs. Families of graphs with longer fixed propagation time for standard forcing are exhibited, and it is shown that such graphs do not exist for positive semidefinite forcing.

  • Product Thottling

    by Sarah E. Anderson, Karen L. Collins, Daniela Ferrero, Leslie Hogben, Carolyn Mayer, Ann N. Trenk, Shanise Walker

  • Open Access

    Product throttling for power domination

    by Sarah E. Anderson, Karen L. Collins, Daniela Ferrero, Leslie Hogben, Carolyn Mayer, Ann N. Trenk, Shanise Walker

    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 equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.

  • Open Access

    Rigid Linkages and Partial Zero Forcing

    by Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan Shader

    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 rigid linkage and thus a vital linkage. A related generalization of zero forcing that produces a rigid linkage via a coloring process is developed. One of the motivations for introducing zero forcing is to provide an upper bound on the maximum multiplicity of an eigenvalue among the real symmetric matrices described by a graph. Rigid linkages and a related notion of rigid shortest linkages are utilized to obtain bounds on the multiplicities of eigenvalues of this family of matrices.


  • Nordhaus–Gaddum problems for power domination

    by Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska


  • Open Access

    Zero forcing in iterated line digraphs

    by Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen

    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 digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electrical power networks. In this paper we study zero forcing in iterated line digraphs and provide a relationship between zero forcing and power domination in line digraphs. In particular, for regular iterated line digraphs we determine the minimum rank/maximum nullity, zero forcing number and power domination number, and provide constructions to attain them. We conclude that regular iterated line digraphs present optimal minimum rank/maximum nullity, zero forcing number and power domination number, and apply our results to determine those parameters on some families of digraphs often used in applications.

  • Zero forcing in iterated line digraphs

    by Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen


  • Chorded Pancyclicity in k-Partite Graphs

    by Daniela Ferrero, Linda Lesniak


  • Open Access

    Chorded pancyclicity in $k$-partite graphs

    by Daniela Ferrero, Linda Lesniak

    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 subgraph of the complete $k$-partite graph $K(n_1,\ldots ,n_k)$ with at least \[{{4 -2p+2n_1+\sum _{i=1}^{k} n_i(p-n_i)}\over 2}\] edges to be chorded pancyclic. Removing all but one edge incident with any vertex of minimum degree in $K(n_1,\ldots ,n_k)$ shows that this result is best possible. Our result implies that for any integers, $k\geq 3$ and $n\geq 1$, a balanced $k$-partite graph of order $kn$ with has at least ${{(k^2-k)n^2-2n(k-1)+4}\over 2}$ edges is chorded pancyclic. In the case $k=3$, this result strengthens a previous one by Adamus, who in 2009 showed that a balanced tripartite graph of order $3n$, $n \geq 2$, with at least $3n^2 - 2n + 2$ edges is pancyclic.