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

8 papers · 1 filter

math.CO2013

Nonexistence of Exceptional 5-class Association Schemes with Two -polynomial Structures

Jianmin Ma, Kaishun Wang

In [H. Suzuki, Association schemes with multiple -polynomial structures, J. Algebraic Combin. 7 (1998) 181-196], Suzuki gave a classification of association schemes with multipl…

math.CO2013

Orthogonal graphs over Galois rings of odd characteristic

Fenggao Li, Jun Guo, Kaishun Wang

Assume that is a positive integer and or . In this paper we introduce the orthogonal graph over a Galois ring of odd characteristic and prove that it is…

math.AG2013

Transformations of polar Grassmannians preserving certain intersecting relations

Wen Liu, Mark Pankov, Kaishun Wang

Let be a polar space of rank . Denote by the polar Grassmannian formed by singular subspaces of whose projective dimension is equal to . Su…

math.CO2013

The smallest one-realization of a given set IV

Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang +1

Let be a finite set of positive integers. A mixed hypergraph is a one-realization of if its feasible set is and each entry of its chromatic spectrum is eithe…

math.CO2013

Identifying codes of Cartesian product of two cliques

Yingnan Zhang, Min Feng, Kaishun Wang

An identifying code in a graph is a dominating set such that the closed neighborhood of each vertex in has a distinct intersection with . In 2008, Gravier et al. det…

math.CO2013

More on the Terwilliger algebra of Johnson schemes

Benjian Lv, Carolina Maldonado, Kaishun Wang

In [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Math. 307 (2007) 1621--1635], the Terwilliger algebra of the Johnson scheme was det…