Amanda Burcroff

most citedTightness of Paired and Upper Domination Inequalities for Direct Product Graphs

2 citations · 4 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2020★ 2 cited

Tightness of Paired and Upper Domination Inequalities for Direct Product Graphs

Amanda Burcroff

A set $D$ of vertices in a graph $G$ is called dominating if every vertex of $G$ is either in $D$ or adjacent to a vertex of $D$ . The paired domination number $γ_{pr} (G)$ …

math.CO2020★ 2 cited

Sets Arising as Minimal Additive Complements in the Integers

Amanda Burcroff, Noah Luntzlara

A subset $C$ of an abelian group $G$ is a minimal additive complement to $W \subseteq G$ if $C + W = G$ and if $C^{'} + W \neq = G$ for any proper subset $C^{'} \subset C$ . In this paper,…

math.CO2018

Domination Parameters of the Unitary Cayley Graph of $Z / n Z$

Amanda Burcroff

The unitary Cayley graph of $Z / n Z$ , denoted $X_{n}$ , is the graph on ${0, \dots, n - 1}$ where vertices $a$ and $b$ are adjacent if and only if $g cd (a - b, n) = 1$ . We…

Tightness of Paired and Upper Domination Inequalities for Direct Product Graphs

Sets Arising as Minimal Additive Complements in the Integers

Domination Parameters of the Unitary Cayley Graph of Z/nZ

Domination Parameters of the Unitary Cayley Graph of $Z / n Z$