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 2017Show all

6 papers · 1 filter

math.CO2017

Lambda number of the power graph of a finite group

Xuanlong Ma, Min Feng, Kaishun Wang

The power graph of a finite group is the graph with the vertex set , where two distinct elements are adjacent if one is a power of the other. An -labeling of…

math.CO2017

Weakly distance-regular digraphs whose attached association schemes are regular

Yuefeng Yang, Benjian Lv, Kaishun Wang

In this paper, we study commutative weakly distance-regular digraphs whose attached association schemes are regular, and give a characterization of mixed arcs. As an application, w…

math.CO2017

Two bounds for generalized -connectivity of Cartesian product graphs

Hui Gao, Benjian Lv, Kaishun Wang

The generalized -connectivity of a graph , which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let and $H…

math.CO2017

Vector spaces and Grassmann graphs over residue class rings

Li-Ping Huang, Benjian Lv, Kaishun Wang

Let be the residue class ring of integers modulo , where is a prime number and is a positive integer. Using matrix representation and the inner rank…

math.CO2017★ 1 cited

On 3-equivalenced weakly distance-regular digraphs

Yuefeng Yang, Benjian Lv, Kaishun Wang

A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumptio…

math.CO2017

Strong rainbow connection numbers of toroidal meshes

Yulong Wei, Min Xu, Kaishun Wang

In 2011, Li et al. \cite{LLL} obtained an upper bound of the strong rainbow connection number of an -dimensional undirected toroidal mesh. In this paper, this bound is improved.…