6 citations · 23 across the 28 of their papers we have counts for
32 papers
Spectral faux trees
Steve Butler, Elena D'Avanzo, Rachel Heikkinen +3
A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral with a tree for the given matrix. We consider the existence of spectral faux tr…
Complements of coalescing sets
Steve Butler, Elena D'Avanzo, Rachel Heikkinen +3
We consider matrices of the form , with being the diagonal matrix of degrees, being the adjacency matrix, and a fixed value. Given a graph and $B\subseteq V(G…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…
Enumerating Parking Completions Using Join and Split
Ayomikun Adeniran, Steve Butler, Galen Dorpalen-Barry +5
Given a strictly increasing sequence with entries from , a parking completion is a sequence with and $|…
Spectral properties of the exponential distance matrix
Steve Butler, Elizabeth Coper, Aaron Li +2
Given a graph , the exponential distance matrix is defined entry-wise by letting the -entry be , where is the distance between th…
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…