8 citations · 21 across the 10 of their papers we have counts for
25 papers · 1 filter
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…
Zero forcing propagation time intervals and graphs with fixed propagation time
Daniela Ferrero, H. Tracy Hall, Leslie Hogben +2
Zero forcing in a graph refers to the evolution of vertex states under repeated application of a color change rule. Typically the states are chosen to be blue and white, and a forc…
Sharp bounds for product and sum throttling numbers
Ryan Blair, Gabriel Elvin, Veronika Furst +3
Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a…
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…
Power domination reconfiguration
Beth Bjorkman, Chassidy Bozeman, Daniela Ferrero +5
The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the me…
Spectra of variants of distance matrices of graphs and digraphs: a survey
Leslie Hogben, Carolyn Reinhart
Distance matrices of graphs were introduced by Graham and Pollack in 1971 to study a problem in communications. Since then, there has been extensive research on the distance matric…