5 citations · 10 across the 13 of their papers we have counts for
17 papers
A strong nullity parameter for rooted graphs
Aida Abiad, Mary Flagg, H. Tracy Hall +2
The inverse eigenvalue problem of a graph studies the possible spectra of matrices associated with , including as an important subproblem the possible nullities of such a ma…
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…
The inverse nullity pair problem and the strong nullity interlacing property
Aida Abiad, Bryan A. Curtis, Mary Flagg +3
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph . In…
A combinatorial bound on the number of distinct eigenvalues of a graph
Sarah Allred, Craig Erickson, Kevin Grace +2
The smallest possible number of distinct eigenvalues of a graph , denoted by , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…
On the Laplacian spread of digraphs
Wayne Barrett, Thomas R. Cameron, Emily Evans +2
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values f…
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…