3 citations · 4 across the 5 of their papers we have counts for
7 papers
The stable maximum nullity of digraphs and -DAGs
Marina Arav, Hein van der Holst
Given a digraph with vertex-set and arc-set , we denote by the set of all real matrices with for al…
Two-connected signed graphs with maximum nullity at most two
Marina Arav, Frank J. Hall, Zhongshan Li +1
A signed graph is a pair , where is a graph (in which parallel edges are permitted, but loops are not) with and . The edges in …
On the inertia set of a signed graph with loops
Marina Arav, Hein van der Holst, John Sinkovic
A signed graph is a pair , where is a graph (in which parallel edges and loops are permitted) with and . The edges in are call…
Minimum ranks of sign patterns via sign vectors and duality
Marina Arav, Frank J. Hall, Zhongshan Li +3
A {\it sign pattern matrix} is a matrix whose entries are from the set . The minimum rank of a sign pattern matrix is the minimum of the ranks of the real matrices…
The minimum rank of a sign pattern matrix with a 1-separation
Marina Arav, Frank J. Hall, Zhongshan Li +3
A sign pattern matrix is a matrix whose entries are from the set . If is an sign pattern matrix, the qualitative class of , denoted , is the set…
A graph minors characterization of signed graphs whose signed Colin de Verdière parameter is two
Marina Arav, Frank J. Hall, Zhongshan Li +1
A signed graph is a pair , where is a graph (in which parallel edges are permitted, but loops are not) with and . The edges in ar…