8 citations · 52 across the 81 of their papers we have counts for
7 papers · 2 filters
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…
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…
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…
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…
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…
Identifying codes of corona product graphs
Min Feng, Kaishun Wang
For a vertex of a graph , let be the set of with all of its neighbors in . A set of vertices is an {\em identifying code} of if the sets $N_G[x]\cap…
Full automorphism groups of association schemes based on isotropic subspaces
Wen Liu, Mark Pankov, Kaishun Wang
The set of all subspaces of a given dimension in a finite classical polar space has a structure of a symmetric association scheme. If the dimension is zero, this is the scheme of t…