8 citations · 52 across the 81 of their papers we have counts for
17 papers · 1 filter
Terwilliger algebra of Odd graphs
Qian Kong, Benjian Lv, Kaishun Wang
In [The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635], Levstein and Maldonado computed the Terwilliger algebra of the Johnson scheme $J(n,…
On the fractional metric dimension of graphs
Min Feng, Benjian Lv, Kaishun Wang
In [S. Arumugam, V. Mathew and J. Shen, On fractional metric dimension of graphs, preprint], Arumugam et al. studied the fractional metric dimension of the cartesian product of two…
The Terwilliger algebra of the incidence graphs of Johnson geometry
Qian Kong, Benjian Lv, Kaishun Wang
Levstein and Maldonado [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635] computed the Terwilliger algebra of t…
The smallest 3-uniform bi-hypergraphs which are one-realization of a given set
Ping Zhao, Kefeng Diao, Kaishun Wang
For any 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 either 0 or 1…
On the metric dimension of line graphs
Min Feng, Min Xu, Kaishun Wang
Let be a (di)graph. A set of vertices in is a \emph{resolving set} of if every vertex of is uniquely determined by its vector of distances to all the vertic…
An Erdős-Ko-Rado theorem in general linear groups
Jun Guo, Kaishun Wang
Let be the symmetric group on points. Deza and Frankl [M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, J. Combin. The…