Daniela Ferrero

activity

20152025

most citedPower domination and zero forcing

14 citations · 45 across the 12 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Rigid linkages and partial zero forcing

Daniela Ferrero, Mary Flagg, H. Tracy Hall +5

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 t…

math.CO2018★ 13 cited

The zero forcing polynomial of a graph

Kirk Boyer, Boris Brimkov, Sean English +5

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 beco…

math.CO2018

Chorded pancyclicity in $k$ -partite graphs

Daniela Ferrero, Linda Lesniak

We prove that for any integers $p \geq k \geq 3$ and any $k$ -tuple of positive integers $(n_{1}, \dots, n_{k})$ such that $p = \sum_{i = 1}^{k} n_{i}$ and $n_{1} \geq n_{2} \geq \dots \geq n_{k}$ , th…

Rigid linkages and partial zero forcing

The zero forcing polynomial of a graph

Chorded pancyclicity in k-partite graphs

Chorded pancyclicity in $k$ -partite graphs