Kaishun Wang

activity

20092026

most citedWeakly distance-regular digraphs of valency three, I

8 citations · 52 across the 81 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.GR2021★ 1 cited

Notes on the diameter of the complement of the power graph of a finite group

Xuanlong Ma, Alireza Doostabadi, Kaishun Wang

We determine the diameter of every connected component of the complement of the power graph and the enhanced power graph of a finite group, which completely answers two questions b…

math.CO2021

Large non-trivial $t$ -intersecting families for signed sets

Tian Yao, Benjian Lv, Kaishun Wang

For positive integers $n, r, k$ with $n \geq r$ and $k \geq 2$ , a set ${(x_{1}, y_{1}), (x_{2}, y_{2}), \dots, (x_{r}, y_{r})}$ is called a $k$ -signed $r$ -set on $[n]$ if $x_{1}, \dots, x_{r}$ are distinct ele…

math.CO2021

Non-trivial $t$ -intersecting families for the distance-regular graphs of bilinear forms

Mengyu Cao, Benjian Lv, Kaishun Wang

Let $V$ be an $(n + ℓ)$ -dimensional vector space over a finite field, and $W$ a fixed $ℓ$ -dimensional subspace of $V$ . Write $[n , 0 V]$ to be the set of all $n$ -dimensiona…

Notes on the diameter of the complement of the power graph of a finite group

Large non-trivial t-intersecting families for signed sets

Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms

Large non-trivial $t$ -intersecting families for signed sets

Non-trivial $t$ -intersecting families for the distance-regular graphs of bilinear forms