98 citations · 348 across the 30 of their papers we have counts for
36 papers
Computer assisted discovery: Zero forcing vs vertex cover
Boris Brimkov, Randy Davila, Houston Schuerger +1
In this paper, we showcase the process of using an automated conjecturing program called \emph{TxGraffiti} written and maintained by the second author. We begin by proving a conjec…
Generalizations of Leaky Forcing
Joseph S. Alameda, Juergen Kritschgau, Michael Young
Vertex leaky forcing was recently introduced as a new variation of zero forcing in order to show how vertex leaks can disrupt the zero forcing process in a graph. An edge leak is a…
On leaky forcing and resilience
Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg +1
A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to anal…
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…
An upper bound for the -power domination number in -uniform hypergraphs
Joseph S. Alameda, Franklin Kenter, Karen Meagher +1
Generalizing work on graphs, Chang and Roussel introduced -power domination in hypergraphs and conjectured the upper bound for the -power domination number for -uniform hy…
Rainbow Numbers of for
Katie Ansaldi, Houssein El Turkey, Jessica Hamm +3
An exact -coloring of a set is a surjective function . The rainbow number of a set for equation is the smallest integer such that every exact -co…