1 citations · 4 across the 10 of their papers we have counts for
13 papers
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…
Relative hulls and quantum codes
Sarah E. Anderson, Eduardo Camps-Moreno, Hiram H. López +3
Given two -ary codes and , the relative hull of with respect to is the intersection . We prove that when , the relative hull dimen…
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…
On well-dominated graphs
Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall
A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian produ…
Service Rate Region of Content Access from Erasure Coded Storage
Sarah Anderson, Ann Johnston, Gauri Joshi +3
We consider storage systems in which files are stored over nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Al…
On the Service Capacity Region of Accessing Erasure Coded Content
Mehmet Aktas, Sarah E. Anderson, Ann Johnston +5
Cloud storage systems generally add redundancy in storing content files such that files are replicated or erasure coded and stored on nodes. In addition to providing re…
Representations of the Multicast Network Problem
Sarah E. Anderson, Wael Halbawi, Nathan Kaplan +4
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of t…