8 citations · 14 across the 17 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
Qing Zeng, Yuefeng Yang, Kaishun Wang
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying…
math.CO2024
Locally semicomplete weakly distance-regular digraphs
Yuefeng Yang, Shuang Li, Kaishun Wang
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces…