15 citations · 16 across the 9 of their papers we have counts for
11 papers
Leaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting
Beth Bjorkman, Lei Cao, Franklin Kenter +3
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. Bl…
Triangle-degree and triangle-distinct graphs
Zhanar Berikkyzy, Beth Bjorkman, Heather Smith Blake +5
Let be a simple graph and be a vertex of . The triangle-degree of in is the number of triangles that contain . While every graph has at least two vertices wit…
Introduction to Robust Power Domination
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 t…
The Power Domination Toolbox
Johnathan Koch, Beth Bjorkman
Phasor Measurement Units (PMUs) are placed at strategic vertices in an electrical power network to monitor the flow of power. Determining the minimum number and optimal placement o…
Power domination reconfiguration
Beth Bjorkman, Chassidy Bozeman, Daniela Ferrero +5
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 me…
Non-Asymptotic Connectivity of Random Graphs and Their Unions
Beth Bjorkman, Matthew Hale, Thomas Lamkin +2
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks…