9 papers · 1 filter
Diamond-free, claw-free cubic graphs are (1, 1, 2, 3)-packing colorable
Sarah E. Anderson, Kirsti Kuenzel, Juan D. Marcano Cuellar
A -packing coloring of a graph is a partition of into two independent sets, a 2-packing, and a -packing. Recently, the question was posed in [A short pr…
Zero Forcing of Generalized Hierarchical Products of Graphs
Heather LeClair, Tim Spilde, Sarah Anderson +1
Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing…
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…