2 citations · 3 across the 11 of their papers we have counts for
3 papers · 1 filter
Properties of a -analogue of zero forcing
Steve Butler, Craig Erickson, Shaun Fallat +6
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation…
Anti-van der Waerden Numbers of Graph Products
Hunter Rehm, Alex Schulte, Nathan Warnberg
In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particul…
Anti-van der Waerden numbers on Graphs
Zhanar Berikkyzy, Alex Schulte, Elizabeth Sprangel +3
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph…