8 citations · 52 across the 81 of their papers we have counts for
9 papers · 1 filter
On weak metric dimension of digraphs
Min Feng, Kaishun Wang, Yuefeng Yang
Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph . We first establish lower and upper bounds for the number of arcs…
Non-trivial -intersecting families for symplectic polar spaces
Tian Yao, Benjian Lv, Kaishun Wang
Let be a symplectic polar space over a finite field , and denote the set of all -dimensional subspaces in . We say a …
Extremal even-cycle-free subgraphs of the complete transposition graphs
Mengyu Cao, Benjian Lv, Kaishun Wang +1
Given graphs and , the generalized Turán number is the maximum number of edges in an -free subgraph of . In this paper, we obtain an asymptotic upper b…
Perfect codes in Cayley sum graphs
Xuanlong Ma, Kaishun Wang, Yuefeng Yang
A subset of the vertex set of a graph is called a perfect code of if every vertex of is at distance no more than one to exactly one vertex in . Let be a fini…
The structure of large non-trivial t-intersecting families for finite sets
Mengyu Cao, Benjian Lv, Kaishun Wang
In this paper, we describe the structure of maximal non-trivial uniform -intersecting families with large size for finite sets. In the special case when , our result gives…
Non-trivial -intersecting families for vector spaces
Mengyu Cao, Benjian Lv, Kaishun Wang +1
Let be an -dimensional vector space over a finite field . In this paper we describe the structure of maximal non-trivial -intersecting families of -dimen…