BBBeth Bjorkman

Beth Bjorkman

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Beth Bjorkman has a total of 15 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

    Leaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting

    by Beth Bjorkman, Lei Cao, Franklin Kenter, Ryan Moruzzi, Carolyn Reinhart, Violeta Vasilevska

    We study a recent variation of zero forcing called leaky forcing. Zero forcing is a propagation process on a network whereby some nodes are initially blue with all others white. Blue vertices can "force" a white neighbor to become blue if all other neighbors are blue. The goal is to find the minimum number of initially blue vertices to eventually force all vertices blue after exhaustively applying the forcing rule above. Leaky forcing is a fault-tolerant variation of zero forcing where certain vertices (not necessarily initially blue) cannot force. The goal in this context is to find the minimum number of initially blue vertices needed that can eventually force all vertices to be blue, regardless of which small number of vertices can't force. This work extends results from zero forcing in terms of leaky forcing. In particular, we provide a complete determination of leaky forcing numbers for all unicyclic graphs and upper bounds for generalized Petersen graphs. We also provide bounds for the effect of both edge removal and vertex removal on the $\ell$-leaky forcing number. Finally, we completely characterize connected graphs that have the minimum and maximum possible $1$-leaky forcing number (i.e., when $Z_{1}(G) = 2$ and when $Z_{1}(G) = |V(G)|-1$).

  • Open Access

    Power domination with random sensor failure

    by Beth Bjorkman, Zachary Brennan, Mary Flagg, Johnathan Koch

    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 failure before the power domination process occurs and call this the fragile power domination process. For a given graph, PMU placement, and probability of PMU failure $q$, we study the expected number of observed vertices at the termination of the fragile power domination process. This expected value is a polynomial in $q$, which we relate to fault-tolerant and PMU-defect-robust power domination. We also study the probability of that the entire graph becomes observed and give results for some graph families.

  • Open Access

    Introduction to Robust Power Domination

    by Beth Bjorkman, Esther Conrad

    Sensors called phasor measurement units (PMUs) are used to monitor the electric power network. The power domination problem seeks to minimize the number of PMUs needed to monitor the network. We extend the power domination problem and consider the minimum number of sensors and appropriate placement to ensure monitoring when $k$ sensors are allowed to fail with multiple sensors allowed to be placed in one location. That is, what is the minimum multiset of the vertices, $S$, such that for every $F\subseteq S$ with $|F|=k$, $S\setminus F$ is a power dominating set. Such a set of PMUs is called a $k$-robust power domination set. This paper generalizes the work done by Pai, Chang and Wang in 2010 on vertex-fault-tolerant power domination, which did not allow for multiple sensors to be placed at the same vertex. We provide general bounds and determine the $k$-robust power domination number of some graph families.