19 citations · 21 across the 11 of their papers we have counts for
15 papers
The Inverse Symplectic Eigenvalue Problem of a Graph
Himanshu Gupta, Leslie Hogben, Bryan Shader +1
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of th…
The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
Shaun M. Fallat, H. Tracy Hall, Jephian C. -H. Lin +1
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property…
Sign Patterns of Orthogonal Matrices and the Strong Inner Product Property
Bryan A. Curtis, Bryan L. Shader
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign pat…
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…
Rigid linkages and partial zero forcing
Daniela Ferrero, Mary Flagg, H. Tracy Hall +5
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown t…
Resolution of Conjectures Related to Lights Out! and Cartesian Products
Bryan Curtis, Jonathan Earl, David Livingston +1
Lights Out! is a game played on a grid of lights, or more generally on a graph. Pressing lights on the grid allows the player to turn off neighboring lights. The goal…