8 citations · 14 across the 17 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
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…
math.CO2020
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…
math.CO2020★ 2 cited
Thick weakly distance-regular digraphs
Yuefeng Yang, Kaishun Wang
A weakly distance-regular digraph is thick if its attached scheme is regular. In this paper, we show that each commutative thick weakly distance-regular digraph has a thick weakly…