3 papers
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.CO2023
Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
Yuefeng Yang, Qing Zeng, Kaishun Wang
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distanc…
math.CO2022
-polynomial weakly distance-regular digraphs
Qing Zeng, Yuefeng Yang, Kaishun Wang
A weakly distance-regular digraph is -polynomial if its attached scheme is -polynomial. In this paper, we characterize all -polynomial weakly distance-regular digraphs.