Marina Arav

activity

20122024

most citedMinimum ranks of sign patterns via sign vectors and duality

3 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014

Two-connected signed graphs with maximum nullity at most two

Marina Arav, Frank J. Hall, Zhongshan Li +1

A signed graph is a pair $(G, Σ)$ , where $G = (V, E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V = {1, \dots, n}$ and $Σ \subseteq E$ . The edges in $Σ$ …

math.CO2014

On the inertia set of a signed graph with loops

Marina Arav, Hein van der Holst, John Sinkovic

A signed graph is a pair $(G, Σ)$ , where $G = (V, E)$ is a graph (in which parallel edges and loops are permitted) with $V = {1, \dots, n}$ and $Σ \subseteq E$ . The edges in $Σ$ are call…