Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
摘要
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In Wang and Suzuki (Discrete Math 264:225–236, 2003), the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this paper, we initiate this project and classify all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes and Doob graphs, respectively.