1 citations · 1 across the 5 of their papers we have counts for
6 papers
Apportionable matrices and gracefully labelled graphs
Antwan Clark, Bryan A. Curtis, Edinah K. Gnang +1
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unita…
Orthogonal realizations of random sign patterns and other applications of the SIPP
Zachary Brennan, Christopher Cox, Bryan A. Curtis +4
A sign pattern is an array with entries in . A matrix is row orthogonal if . The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~…
Zero Forcing with Random Sets
Bryan Curtis, Luyining Gan, Jamie Haddock +2
Given a graph and a real number , we define the random set by including each vertex independently and with probability . We investigate the…
Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other -set parameters
Novi H. Bong, Joshua Carlson, Bryan Curtis +2
An -TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property , with an edge between two sets if one is obtained from the other b…
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…
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…