Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YJJMNLARrecord.jsonopen to challenge →
classification
math.CO
keywords
distance-regulargraphsweaklydigraphsunderlyingwhoseauthorclassify
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.