2 citations · 3 across the 17 of their papers we have counts for
31 papers
The forbidden structure for zero forcing number
Carlos A. Alfaro, Michael D. Barrus, Sergio Gerardo Gómez-Galicia +5
The {\it zero forcing number} of a graph , , is a well-studied parameter which arises from a color changing process and has strong connections to {\it minimum rank}, {\it…
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…
Inverse eigenvalue problem for Laplacian matrices of a graph
Shaun Fallat, Himanshu Gupta, Jephian C. -H. Lin
For a given graph , we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with . This new…
Inverse Fiedler vector problem of a graph
Jephian C. -H. Lin, Mahsa N Shirazi
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely…
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…
The liberation set in the inverse eigenvalue problem of a graph
Jephian C. -H. Lin, Polona Oblak, Helena Šmigoc
The inverse eigenvalue problem of a graph is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the a…