3 papers
math.CO2024
Probabilistic Zero Forcing with Vertex Reversion
Zachary Brennan
Probabilistic zero forcing is a graph coloring process in which blue vertices "infect" (color blue) white vertices with a probability proportional to the number of neighboring blue…
math.CO2023
Power domination with random sensor failure
Beth Bjorkman, Zachary Brennan, Mary Flagg +1
The power domination problem seeks to determine the minimum number of phasor measurement units (PMUs) needed to monitor an electric power network. We introduce random sensor failur…
math.CO2022
Orthogonal realizations of random sign patterns and other applications of the SIPP
Zachary Brennan, Christopher Cox, Bryan A. Curtis +4
A sign pattern is an array with entries in . A matrix is row orthogonal if . The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~…