Zhongshan Li

most citedThe inertia set of a signed graph

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

collaborators

4 papers

math.CO2017

Sign patterns that require $H_{n}$ exist for each $n \geq 4$

Wei Gao, Zhongshan Li, Lihua Zhang

The refined inertia of a square real matrix $A$ is the ordered $4$ -tuple $(n_{+}, n_{-}, n_{z}, 2 n_{p})$ , where $n_{+}$ (resp., $n_{-}$ ) is the number of eigenvalues of $A$ with positive (resp…

math.CO2017

On the number of vertices of the stochastic tensor polytope

Zhongshan Li, Fuzhen Zhang, Xiao-Dong Zhang

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n \times n \times n$ stochastic tensors (i.e., triply stochastic arrays of…

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…

Sign patterns that require Hn​ exist for each n≥4

On the number of vertices of the stochastic tensor polytope

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

The inertia set of a signed graph

Sign patterns that require $H_{n}$ exist for each $n \geq 4$

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