… By Proposition 1.1, it is easy to see that every thin weakly distance-regular digraph is a weakly
distance-transitive digraph. We remark that a thin weakly distanceregular digraph CayðG, …

… digraph of a commutative weakly distance-transitive digraph of girth … of weakly distance-regular
digraphs which are not weakly … determined all thin weakly distance-regular digraphs and …

… distance-regular graph ie a weakly distance-regular digraph. A strongly connected digraph
\(\Gamma \) is said to be weakly distance-regular … of weakly distance-regular digraphs is that \(…

… A weakly distance-regular digraph is quasi-thin if the maximum … -thin weakly distance-regular
digraphs, and classify such … quasi-thin weakly distance-regular digraph of valency more …

… A weakly distance-regular digraph is quasi-thin if the maximum value of its … Let Γ be a
commutative quasi-thin weakly distance-regular digraph of valency more than 3 in the remaining of …

… so-called thin weakly distance-regular digraphs (see … weakly distance-regular digraphs,
see [16, 19–23]. Now, we state the result of classifying all thin weakly distance-regular digraphs…

… concept of weakly distance-regular digraphs. A digraph Γ is said to be weakly distance-regular
if, … 9–13] for small valency, [9] for thin case, [14] for quasithin case, and [15] for thick case. …

… basic results for weakly distance-regular digraphs. In Sections … semicomplete commutative
weakly distance-regular digraph, … that Γ is a weakly distance-regular digraph. We shall give …

… special families of weakly distance-regular digraphs in sense … on weakly distance-regular
digraphs, called thin, quasi-thin … in the study of weakly distance-regular digraphs in sense of …

… all thin weakly distance-regular digraphs and … of weakly distance-regular digraphs of valency
3. In Section 3, we discuss some properties for circuits of weakly distance-regular digraphs. …