Weiqiang Li

activity

20132015

most citedDisconnecting strongly regular graphs

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

collaborators

3 papers

math.CO2015★ 14 cited

Max-cut and extendability of matchings in distance-regular graphs

Sebastian M. Cioabă, Jack H. Koolen, Weiqiang Li

Let $G$ be a distance-regular graph of order $v$ and size $e$ . In this paper, we show that the max-cut in $G$ is at most $e (1 - 1/ g)$ , where $g$ is the odd girth of $G$ . This result…

math.CO2014

On the Spectrum of Wenger Graphs

Sebastian M. Cioabă, Felix Lazebnik, Weiqiang Li

Let $q = p^{e}$ , where $p$ is a prime and $e \geq 1$ is an integer. For $m \geq 1$ , let $P$ and $L$ be two copies of the $(m + 1)$ -dimensional vector spaces over the finite field $\mathbb{…

math.CO2013★ 15 cited

Disconnecting strongly regular graphs

Sebastian M. Cioabă, Jack H. Koolen, Weiqiang Li

In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighb…