8 citations · 22 across the 11 of their papers we have counts for
6 papers · 1 filter
Propagation time for probabilistic zero forcing
Jesse Geneson, Leslie Hogben
Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repea…
Graphs that are cospectral for the distance Laplacian
Boris Brimkov, Ken Duna, Leslie Hogben +4
The distance matrix of a graph is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\m…
Zero forcing and maximum nullity for hypergraphs
Leslie Hogben
The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family…
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…
Throttling positive semidefinite zero forcing propagation time on graphs
Joshua Carlson, Leslie Hogben, Jürgen Kritschgau +4
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size…
The sepr-sets of sign patterns
Leslie Hogben, Jephian C. -H. Lin, D. D. Olesky +1
Given a real symmetric matrix, the sepr-sequence records information about the existence of principal minors of each order that are positive, negative,…