6 citations · 23 across the 28 of their papers we have counts for
4 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…
On the genus of a quotient of a numerical semigroup
Ayomikun Adeniran, Steve Butler, Colin Defant +6
We find a relation between the genus of a quotient of a numerical semigroup and the genus of itself. We use this identity to compute the genus of a quotient of when …
Graphs with at most two trees in a forest building process
Steve Butler, Misa Hamanaka, Marie Hardt
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The…
Graph switching, 2-ranks, and graphical Hadamard matrices
Aida Abiad, Steve Butler, Willem H. Haemers
We study the behaviour of the 2-rank of the adjacency matrix of a graph under Seidel and Godsil-McKay switching, and apply the result to graphs coming from graphical Hadamard matri…