9 papers
Orientable domination in product-like graphs
Sarah Anderson, Boštjan Brešar, Sandi Klavžar +2
The orientable domination number, , of a graph is the largest domination number over all orientations of . In this paper, is studied on different p…
Power domination in cubic graphs and Cartesian products
Sarah E. Anderson, Kirsti Kuenzel
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power…
Graphs which satisfy a Vizing-like bound for power domination of Cartesian products
Sarah E. Anderson, Kirsti Kuenzel, Houston Schuerger
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph , a su…
On well-edge-dominated graphs
Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall
A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It is known that every well-edge-dominated graph is also equimatchable, meaning t…
Product Throttling
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
Throttling addresses the question of minimizing the sum or the product of the resources used to accomplish a task and the time needed to complete that task for various graph search…
Product throttling for power domination
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
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…