5 citations · 5 across the 7 of their papers we have counts for
7 papers
The inverse eigenvalue problem for probe graphs
Emelie Curl, Jürgen Kritschgau, Carolyn Reinhart +1
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe v…
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
Sarah Allred, Emelie Curl, Shaun Fallat +4
The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently t…
On the zero forcing number of the complement of graphs with forbidden subgraphs
Emelie Curl, Shaun Fallat, Ryan Moruzzi +2
Motivated in part by an observation that the zero forcing number for the complement of a tree on vertices is either or in one exceptional case, we consider the zero…
The Polychromatic Number of Small Subsets of the Integers Modulo
Emelie Curl, John Goldwasser, Joe Sampson +1
If is a subset of an abelian group , the polychromatic number of in is the largest integer so that there is a coloring of the elements of such that every…
Skew throttling
Emelie Curl, Jesse Geneson, Leslie Hogben
Zero forcing is a process that colors the vertices of a graph blue by starting with some vertices blue and applying a color change rule. Throttling minimizes the sum of the number…
Using Markov chains to determine expected propagation time for probabilistic zero forcing
Yu Chan, Emelie Curl, Jesse Geneson +4
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (determin…
The Dual Kaczmarz Algorithm
Anna Aboud, Emelie Curl, Steven N. Harding +2
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector in a (separable) Hilbert space from the…