Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
Combinatorics
2024-04-11 v3
Abstract
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 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.
Keywords
Cite
@article{arxiv.2305.00276,
title = {Weakly distance-regular digraphs whose underlying graphs are distance-regular, I},
author = {Yuefeng Yang and Qing Zeng and Kaishun Wang},
journal= {arXiv preprint arXiv:2305.00276},
year = {2024}
}