2 citations · 2 across the 4 of their papers we have counts for
5 papers
A combinatorial bound on the number of distinct eigenvalues of a graph
Sarah Allred, Craig Erickson, Kevin Grace +2
The smallest possible number of distinct eigenvalues of a graph , denoted by , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…
Complementary Vanishing Graphs
Craig Erickson, Luyining Gan, Jürgen Kritschgau +2
Given a graph with vertices , we define to be the set of symmetric matrices such that for we have if…
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…
Restricted power domination and zero forcing problems
Chassidy Bozeman, Boris Brimkov, Craig Erickson +3
Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of…
Rainbow arithmetic progressions
Steve Butler, Craig Erickson, Leslie Hogben +8
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers and , the expression $aw([n…