8 citations · 52 across the 81 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Primitive weakly distance-regular circulant digraphs
Akihiro Munemasa, Kaishun Wang, Yuefeng Yang
We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.
math.CO2019★ 1 cited
On even-cycle-free subgraphs of the doubled Johnson graphs
Mengyu Cao, Benjian lv, Kaishun Wang
The generalized Turán number is the maximum number of edges in an -free subgraph of a graph It is an important extension of the classical Turán number ${\rm…
math.CO2019★ 1 cited
Non-trivial intersecting families for finite affine spaces
Chao Gong, Benjian Lv, Kaishun Wang
Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we charact…