H. Holst

most citedThe inertia set of a signed graph

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2024

The stable maximum nullity of digraphs and $1$ -DAGs

Marina Arav, Hein van der Holst

Given a digraph $D = (V, A)$ with vertex-set $V = {1, \dots, n}$ and arc-set $A$ , we denote by $Q (D)$ the set of all real $n \times n$ matrices $B = [b_{u, w}]$ with $b_{u, u} \neq = 0$ for al…

math.CO2012

The inverse inertia problem for the complements of partial $k$ -trees

Hein van der Holst

Let $F$ be an infinite field with characteristic different from two. For a graph $G = (V, E)$ with $V = 1, ..., n$ , let $S (G; F)$ be the set of all symmetric $n\times n…

math.CO2012

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 $(G, Σ)$ , where $G = (V, E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V = {1, ..., n}$ and $Σ \subseteq E$ . The edges in $Σ$ ar…

math.CO2012★ 1 cited

The inertia set of a signed graph

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, ..., n$ and $Σ \subseteq E$ . By $S (G, Σ)$ we denote…

The stable maximum nullity of digraphs and 1-DAGs

The inverse inertia problem for the complements of partial k-trees

A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two

The inertia set of a signed graph

The stable maximum nullity of digraphs and $1$ -DAGs

The inverse inertia problem for the complements of partial $k$ -trees

A graph minors characterization of signed graphs whose signed Colin de Verdière parameter $ν$ is two