Weakly Distance-Regular Digraphs

• Weakly distance-regular digraphs are strongly connected directed graphs whose two-way distance partitions form an association scheme with specific intersection numbers.
• They are classified via algebraic, combinatorial, and spectral methods, with explicit models such as Cayley digraphs and designated P-polynomial structures.
• Recent research emphasizes classification under commutativity and arc-type conditions, offering rigidity principles that simplify the overall structural analysis.

Weakly distance-regular digraphs are the directed analogue of distance-regular graphs: they are strongly connected digraphs in which the partition of ordered vertex pairs by two-way distance carries the regularity needed to form an association scheme. In this framework, the basic invariants are not ordinary distances alone but ordered pairs $(\partial(x,y),\partial(y,x))$, and the corresponding intersection numbers encode the local directed geometry. Recent work has developed the subject along several tightly connected lines: algebraic characterization through attached association schemes, classification under commutativity and other regularity assumptions, explicit Cayley-model realizations, and structural links with distance-regular graphs, Schur rings, and spectral excess theory (Wang et al., 15 Jul 2025, Omidi, 2013).

1. Definitions and association-scheme framework

Let $\Gamma$ be a finite, simple, strongly connected digraph. For vertices $x,y\in V\Gamma$, the directed distance is $\partial_\Gamma(x,y)$, and the two-way distance is

$$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$

For each two-way distance type $\widetilde{i}$, one considers the relation

$$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$

A digraph is weakly distance-regular if, for any $h,i,j\in \widetilde{\partial}(\Gamma)$, the number of vertices $z$ such that $\widetilde{\partial}(x,z)=i$ and $\Gamma$0 depends only on $\Gamma$1, not on the particular choice of $\Gamma$2. These constants are the intersection numbers $\Gamma$3. Equivalently, the configuration formed by the relations $\Gamma$4 is an association scheme; different papers denote this attached scheme by $\Gamma$5, $\Gamma$6, or $\Gamma$7 (Wang et al., 15 Jul 2025, Zeng et al., 2022).

The association-scheme viewpoint supplies the standard algebraic apparatus. If $\Gamma$8 is the adjacency matrix of relation $\Gamma$9, then

$x,y\in V\Gamma$0

Valencies are given by $x,y\in V\Gamma$1, and in the two-way-distance notation one also writes $x,y\in V\Gamma$2. A weakly distance-regular digraph is commutative if $x,y\in V\Gamma$3 for all $x,y\in V\Gamma$4. This commutativity hypothesis is pervasive in the classification literature because it sharply constrains relation products and often forces explicit Cayley realizations (Wang et al., 15 Jul 2025, Fan et al., 2021).

Arc types are encoded by return distances. An arc $x,y\in V\Gamma$5 is of type $x,y\in V\Gamma$6 if $x,y\in V\Gamma$7. Many of the strongest classification theorems are organized by the set of arc types, by whether a type is pure or mixed, and by the behavior of distinguished intersection numbers such as $x,y\in V\Gamma$8 (Yang et al., 2024, Yang et al., 2016).

2. Distance-regularity, $x,y\in V\Gamma$9-polynomiality, and algebraic restrictions

Weakly distance-regular digraphs sit strictly between general strongly connected digraphs and the classical distance-regular objects. In diameter $\partial_\Gamma(x,y)$0, distance-regular graphs are exactly symmetric $\partial_\Gamma(x,y)$1-class association schemes, distance-regular digraphs are exactly non-symmetric $\partial_\Gamma(x,y)$2-class association schemes, and weakly distance-regular digraphs are the broader directed version in which the partition is by two-way distance and the attached scheme may have more than two classes (Wang et al., 15 Jul 2025). For connected digraphs, a fundamental characterization states that a digraph is distance-regular if and only if it is both normal and weakly distance-regular (Omidi, 2013).

A major algebraic subclass consists of $\partial_\Gamma(x,y)$3-polynomial weakly distance-regular digraphs, meaning that the attached scheme $\partial_\Gamma(x,y)$4 is $\partial_\Gamma(x,y)$5-polynomial with respect to $\partial_\Gamma(x,y)$6, so that

$\partial_\Gamma(x,y)$7

The complete classification shows that such a digraph is isomorphic to one of six types: $\partial_\Gamma(x,y)$8 or $\partial_\Gamma(x,y)$9; $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$0 or $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$1, where $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$2 and $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$3; $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$4 or $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$5, where $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$6; $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$7 or $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$8, where $$\widetilde{\partial}(x,y)=\bigl(\partial_\Gamma(x,y),\partial_\Gamma(y,x)\bigr).$$9; $\widetilde{i}$0 or $\widetilde{i}$1, where $\widetilde{i}$2, $\widetilde{i}$3, and $\widetilde{i}$4; or $\widetilde{i}$5 or $\widetilde{i}$6, where $\widetilde{i}$7, $\widetilde{i}$8, and $\widetilde{i}$9 (Zeng et al., 2022). The same work recalls Damerell’s theorem that distance-regular digraphs are stable and satisfy $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$0 or $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$1, with the long-type case $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$2 arising as a lexicographic product of a short-type distance-regular digraph by an empty graph (Zeng et al., 2022).

Other global restrictions also admit classification. In the quasi-thin case, where all intersection numbers satisfy $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$3, commutative weakly distance-regular digraphs of valency $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$4 are completely determined and every example is one of ten explicit Cayley digraph families (Yang et al., 2016). In the thick case, where the attached scheme is regular in the sense that $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$5, each commutative thick weakly distance-regular digraph has a thick weakly distance-regular subdigraph such that the corresponding quotient digraph belongs to one of six explicit families up to isomorphism (Yang et al., 2020). These results show that strong algebraic hypotheses tend to collapse the general theory to a short list of explicit models.

3. Arc types, purity, and one-type classifications

The combinatorics of arc types is one of the main organizing principles of the subject. For a type $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$6, an arc is pure if every circuit of length $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$7 containing it consists entirely of arcs of that same type; otherwise it is mixed. Several papers use configurations such as $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$8, $$\Gamma_{\widetilde{i}}=\{(x,y)\mid \widetilde{\partial}(x,y)=\widetilde{i}\}.$$9, or $h,i,j\in \widetilde{\partial}(\Gamma)$0 to characterize mixedness and to force specific products of relations (Yang et al., 2024, Yang et al., 2016, Yang et al., 2020). This local dichotomy repeatedly drives global classification.

The valency-$h,i,j\in \widetilde{\partial}(\Gamma)$1 classification program is historically central. Weakly distance-regular digraphs of valency $h,i,j\in \widetilde{\partial}(\Gamma)$2, girth $h,i,j\in \widetilde{\partial}(\Gamma)$3, and two types of arcs are classified by one explicit Cayley family on $h,i,j\in \widetilde{\partial}(\Gamma)$4 together with three subfamilies of the construction $h,i,j\in \widetilde{\partial}(\Gamma)$5 (Yang et al., 2015). The complementary case of one type of arcs yields a complete classification of commutative weakly distance-regular digraphs of valency $h,i,j\in \widetilde{\partial}(\Gamma)$6: $h,i,j\in \widetilde{\partial}(\Gamma)$7, $h,i,j\in \widetilde{\partial}(\Gamma)$8, $h,i,j\in \widetilde{\partial}(\Gamma)$9, the eighteenth digraph with $z$0 vertices from Hanaki’s catalog, $z$1, $z$2, $z$3 with $z$4, and $z$5 with $z$6 (Yang et al., 2016).

A later theorem extends the one-type program to higher valency. Let $z$7 be a commutative weakly distance-regular digraph of valency $z$8 and girth $z$9, assume that every arc has type $\widetilde{\partial}(x,z)=i$0, and suppose

$\widetilde{\partial}(x,z)=i$1

Then $\widetilde{\partial}(x,z)=i$2 is isomorphic to exactly one of five Cayley digraphs (Fan et al., 2021).

Family	Status
$\widetilde{\partial}(x,z)=i$3	sporadic
$\widetilde{\partial}(x,z)=i$4	sporadic
$\widetilde{\partial}(x,z)=i$5	sporadic
$\widetilde{\partial}(x,z)=i$6	infinite
$\widetilde{\partial}(x,z)=i$7	infinite

The decisive local quantity here is $\widetilde{\partial}(x,z)=i$8. The proof splits according to whether it equals $\widetilde{\partial}(x,z)=i$9 or $\Gamma$00, and in the nontrivial cases the girth is forced to be $\Gamma$01. The authors also state explicitly that their theorem improves and recovers the earlier valency-$\Gamma$02 one-type classification as a special case (Fan et al., 2021). A common misconception is that the one-type condition by itself leaves the girth largely unconstrained; under this near-maximal intersection-number hypothesis, the surviving structure is much more rigid.

4. Diameter $\Gamma$03 and low-class structure

The diameter-$\Gamma$04 case has a particularly clean description because the possible two-way distances are tightly bounded: $\Gamma$05 Hence the attached association scheme has at most $\Gamma$06 classes, and by Higman’s theorem any association scheme with at most four classes is commutative (Wang et al., 15 Jul 2025). This sharply reduces the classification problem.

The complete theorem states that a digraph $\Gamma$07 is a weakly distance-regular digraph of diameter $\Gamma$08 with attached scheme $\Gamma$09 if and only if $\Gamma$10 has exactly one pair of non-symmetric relations, say $\Gamma$11, and one of four alternatives holds: $\Gamma$12 and $\Gamma$13; $\Gamma$14 and $\Gamma$15; $\Gamma$16, $\Gamma$17, and $\Gamma$18 is neither a $\Gamma$19-polynomial association scheme nor a wedge product of the specified subschemes and a $\Gamma$20-class association scheme; or $\Gamma$21, $\Gamma$22, and $\Gamma$23 is neither a wreath product of a $\Gamma$24-class association scheme and a $\Gamma$25-polynomial association scheme nor the corresponding wedge product (Wang et al., 15 Jul 2025). In the $\Gamma$26 case, a necessity theorem shows that every diameter-$\Gamma$27 weakly distance-regular digraph with $\Gamma$28 classes must have the form $\Gamma$29 with $\Gamma$30 and $\Gamma$31, subject to those excluded decompositions (Wang et al., 15 Jul 2025).

This classification underscores two methodological points. First, low diameter is best handled in association-scheme language rather than by ad hoc path counting. Second, the main obstructions are not arbitrary exceptions but specific product decompositions—$\Gamma$32-polynomial, wreath-product, and wedge-product degeneracies—that must be excluded before the remaining structure becomes rigid.

5. Special ambient geometries, Cayley models, and circulants

A large fraction of the known classifications concern weakly distance-regular digraphs embedded in a highly structured ambient class. The following programs are representative.

Setting	Conclusion	Paper
Underlying Hamming, folded $\Gamma$33-cube, or Doob graph	Hamming case classified; no folded $\Gamma$34-cube for $\Gamma$35; unique Doob case $\Gamma$36	(Yang et al., 2023)
Underlying Johnson or folded Johnson graph	Only $\Gamma$37 or $\Gamma$38; no folded Johnson graph of diameter at least $\Gamma$39 occurs	(Zeng et al., 2024)
Locally semicomplete but not semicomplete	Exactly three lexicographic/generalized lexicographic families	(Yang et al., 2024)
Semicomplete multipartite	Exactly five families, including coclique extensions and Type II structures	(Li et al., 19 Jan 2025)
Circulants of one type of arcs	$\Gamma$40, $\Gamma$41, $\Gamma$42, $\Gamma$43	(Munemasa et al., 2023)
Primitive circulants	Paley digraphs of prime order, directed circuits of prime length, and $\Gamma$44	(Munemasa et al., 2019)

In the orientation-of-distance-regular-graphs program, the commutative hypothesis is again decisive. For Hamming graphs, the classification reduces to small explicit digraphs and Cartesian products of semicomplete weakly distance-regular diameter-$\Gamma$45 factors; for folded $\Gamma$46-cubes, no commutative weakly distance-regular orientation exists when $\Gamma$47; and for Doob graphs, exactly one example survives (Yang et al., 2023). The Johnson and folded Johnson continuation is even more rigid: only two small circulants occur, and in particular no folded Johnson graph of diameter at least $\Gamma$48 can appear as an underlying graph (Zeng et al., 2024).

The semicomplete side of the theory has a parallel taxonomy. Locally semicomplete commutative weakly distance-regular digraphs that are not semicomplete are exactly $\Gamma$49, $\Gamma$50, and $\Gamma$51, with the stated conditions on $\Gamma$52 and identical intersection numbers in the fibers (Yang et al., 2024). Semicomplete multipartite commutative weakly distance-regular digraphs are likewise classified by five families, including $\Gamma$53-coclique extensions of $\Gamma$54, extensions of semicomplete weakly distance-regular digraphs with girth $\Gamma$55 or $\Gamma$56, and Type II doubly regular team semicomplete multipartite digraphs (Li et al., 19 Jan 2025).

For circulants, Schur-ring methods provide an especially clean algebraic translation. A Cayley digraph $\Gamma$57 is weakly distance-regular if and only if its two-way distance module $\Gamma$58 is an $\Gamma$59-ring, and in the primitive case primitivity of the digraph is equivalent to primitivity of that $\Gamma$60-ring (Munemasa et al., 2023). This explains why circulant classifications repeatedly culminate in cyclotomic or Paley-type examples and a small number of exceptional Cayley digraphs.

6. Spectral characterizations and conceptual significance

Beyond classification, weakly distance-regular digraphs admit strong recognition theorems. For a connected digraph with distance matrices $\Gamma$61 and pre-distance polynomials $\Gamma$62, the following are equivalent: $\Gamma$63 is weakly distance-regular; $\Gamma$64 for each $\Gamma$65; $\Gamma$66 is a basis of the adjacency algebra; and the numbers $\Gamma$67 depend only on $\Gamma$68 (Omidi, 2013). The same paper proves a family of projection inequalities in which equality holds if and only if the digraph is weakly distance-regular, thereby giving recognition criteria in terms of equality of two invariants rather than direct verification of all intersection numbers (Omidi, 2013).

For connected normal digraphs with $\Gamma$69 distinct eigenvalues, the spectral excess philosophy extends to the directed setting. The simple excess $\Gamma$70 satisfies

$\Gamma$71

where $\Gamma$72 is the spectral excess determined by the spectrum; equality holds if and only if the digraph is distance-regular. A weighted version using the Hoffman polynomial yields an analogous criterion, and these results imply that a connected normal digraph is either bipartite, or a generalized odd graph, or has odd-girth at most $\Gamma$73 (Omidi, 2013). Since distance-regularity of a digraph is equivalent to normality plus weak distance-regularity, these theorems place weak distance-regular digraphs at the exact interface between combinatorial regularity and spectral structure.

Taken together, the classification and recognition results show a consistent pattern. Most complete classifications currently require commutativity, and the decisive tools are almost always the same: control of two-way-distance relations, exact or near-exact intersection-number identities, quotient and product constructions, and eventual identification with explicit Cayley models. This suggests that the subject is less a single classification theorem than a family of rigidity principles, all rooted in the association-scheme structure imposed by two-way distance.