8 citations · 8 across the 5 of their papers we have counts for
6 papers
Spectral arbitrariness for trees fails spectacularly
Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene +4
If is a graph and is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph , what can we say about the eigenvalues of all…
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…
The minimum rank problem for circulants
Louis Deaett, Seth A. Meyer
The minimum rank problem is to determine for a graph the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacenc…
Patterns of Alternating Sign Matrices
Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer +1
We initiate a study of the zero-nonzero patterns of n by n alternating sign matrices. We characterize the row (column) sum vectors of these patterns and determine their minimum ter…
On the t-Term Rank of a Matrix
Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer +1
For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus th…
Zero Forcing Sets and Bipartite Circulants
Seth A. Meyer
In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper…