Sarah E. Anderson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sarah E. Anderson has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Douglas F. Rall
Emeritus Professor of Mathematics Furman University Greenville SC USA
4 shared publications - Kirsti Kuenzel
Department of Mathematics, Trinity College, Hartford, USA
4 shared publications - Brenda Kroschel
Department of Mathematics, University of St. Thomas, St. Paul, USA
2 shared publications Ann Johnston
Penn State University University Park Pennsylvania USA
1 shared publication- Ann N. Trenk
Department of Mathematics, Wellesley College, Wellesley, USA
1 shared publication - Carolyn Mayer
Department of Mathematical Sciences American Insti- tute of Mathematics 95112 San Jose CA USA
1 shared publication
Latest Publications
- Open Access
Domination and Total Domination Numbers in Zero-divisor Graphs of Commutative Rings
Zero-divisor graphs of commutative rings are well-represented in the literature. In this paper, we consider dominating sets, total dominating sets, domination numbers and total domination numbers of zero-divisor graphs. We determine the domination and total domination numbers of zero-divisor graphs are equal for all zero-divisor graphs of commutative rings except for $\mathbb{Z}_2 \times D$ in which $D$ is a domain. In this case, $γ(Γ(\mathbb{Z}_2 \times D)) = 1$ and $γ_t(Γ(\mathbb{Z}_2 \times D)) = 2$.Open AccessDomination and Total Domination Numbers in Zero-divisor Graphs of Commutative Rings
Zero-divisor graphs of commutative rings are well-represented in the literature. In this paper, we consider dominating sets, total dominating sets, domination numbers and total domination numbers of zero-divisor graphs. We determine the domination and total domination numbers of zero-divisor graphs are equal for all zero-divisor graphs of commutative rings except for $\mathbb{Z}_2 \times D$ in which $D$ is a domain. In this case, $γ(Γ(\mathbb{Z}_2 \times D)) = 1$ and $γ_t(Γ(\mathbb{Z}_2 \times D)) = 2$. - Open Access
Zero Forcing of Generalized Hierarchical Products of Graphs
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 number is the smallest number of vertices that must be filled to begin the process so that the entire graph or network becomes filled. In this paper, bounds are provided on the zero forcing number of generalized hierarchical products.
Open AccessZero Forcing of Generalized Hierarchical Products of Graphs
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 number is the smallest number of vertices that must be filled to begin the process so that the entire graph or network becomes filled. In this paper, bounds are provided on the zero forcing number of generalized hierarchical products.
- 27 September 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (5) , 1
Correction to: On Well-Edge-Dominated Graphs
- 27 September 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (5) , 1
Correction to: On Well-Edge-Dominated Graphs
- 9 June 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (4) , 1-14
On Well-Edge-Dominated Graphs
- 9 June 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (4) , 1-14
On Well-Edge-Dominated Graphs
- Open Access
Product throttling for power domination
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 throttling number. It is established that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.
Open AccessProduct throttling for power domination
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 throttling number. It is established that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.
- 25 September 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (1) , 151-165
On Well-Dominated Graphs
- 25 September 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (1) , 151-165
On Well-Dominated Graphs
- Open Access
On well-dominated graphs
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 product of two graphs is well-dominated. In addition, we show that the Cartesian product of two connected, triangle-free graphs is well-dominated if and only if both graphs are complete graphs of order $2$. Under the assumption that at least one of the connected graphs $G$ or $H$ has no isolatable vertices, we prove that the direct product of $G$ and $H$ is well-dominated if and only if either $G=H=K_3$ or $G=K_2$ and $H$ is either the $4$-cycle or the corona of a connected graph. Furthermore, we show that the disjunctive product of two connected graphs is well-dominated if and only if one of the factors is a complete graph and the other factor has domination number at most $2$.Open AccessOn well-dominated graphs
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 product of two graphs is well-dominated. In addition, we show that the Cartesian product of two connected, triangle-free graphs is well-dominated if and only if both graphs are complete graphs of order $2$. Under the assumption that at least one of the connected graphs $G$ or $H$ has no isolatable vertices, we prove that the direct product of $G$ and $H$ is well-dominated if and only if either $G=H=K_3$ or $G=K_2$ and $H$ is either the $4$-cycle or the corona of a connected graph. Furthermore, we show that the disjunctive product of two connected graphs is well-dominated if and only if one of the factors is a complete graph and the other factor has domination number at most $2$. - Open Access
Service Rate Region of Content Access from Erasure Coded Storage
We consider storage systems in which $K$ files are stored over $N$ nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file $f_k$ arrive at rate $\lambda_k$, and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a $3$-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file $K$ given $\lambda_1,\dots, \lambda_{K-1}$ in a general $K$-file case.Open AccessService Rate Region of Content Access from Erasure Coded Storage
We consider storage systems in which $K$ files are stored over $N$ nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file $f_k$ arrive at rate $\lambda_k$, and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a $3$-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file $K$ given $\lambda_1,\dots, \lambda_{K-1}$ in a general $K$-file case. - 1 August 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (1) , 20-24
Domination in the hierarchical product and Vizing’s conjecture
- 1 August 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (1) , 20-24
Domination in the hierarchical product and Vizing’s conjecture