# Weakly distance-regular digraphs of one type of arcs

@inproceedings{Fan2021WeaklyDD, title={Weakly distance-regular digraphs of one type of arcs}, author={Yushuang Fan and Zhiqi Wang and Yuefeng Yang}, year={2021} }

In this paper, we classify all commutative weakly distance-regular digraphs of girth g and one type of arcs under the assumption that p (2,g−2) (1,g−1),(1,g−1) ≥ k1,g−1 − 2. In consequence, we recover [13, Theorem 1.1] as a special case of

#### References

SHOWING 1-10 OF 25 REFERENCES

Weakly Distance-Regular Digraphs of Valency Three, I

- Mathematics, Computer Science
- Electron. J. Comb.
- 2016

This project to classify weakly distance-regular digraphs of valency 3 with girth more than 2 and two types of arcs is continued. Expand

Weakly Distance-Regular Digraphs of Valency Three, I

- Mathematics
- 2016

Suzuki (2004) classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third… Expand

Quasi-thin weakly distance-regular digraphs

- Mathematics
- Journal of Algebraic Combinatorics
- 2019

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify… Expand

Commutative weakly distance-regular digraphs of girth 2

- Computer Science, Mathematics
- Eur. J. Comb.
- 2004

It is proved that a certain quotientDigraph of a commutative weakly distance-transitive digraph of girth 2 is a distance-Transitive graph. Expand

Thin weakly distance-regular digraphs

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2004

The classification of thin weakly distance-regular digraphs amounts to the determination of all finite groups G possessing a distinguished generating subset S that satisfies the following property: x = y. Expand

Weakly Distance-regular Digraphs

- Computer Science, Mathematics
- Discret. Math.
- 2003

All commutative weakly distance-regular digraphs of valency 2 are determined and the connections to association schemes are discussed. Expand

Theory of Association Schemes

- Mathematics
- 2005

Basic Facts.- Closed Subsets.- Generating Subsets.- Quotient Schemes.- Morphisms.- Faithful Maps.- Products.- From Thin Schemes to Modules.- Scheme Rings.- Dihedral Closed Subsets.- Coxeter Sets.-… Expand

Generalized table algebras

- Mathematics
- 1999

A table algebra was defined in [1] in order to consider in a uniform way the common properties of conjugacy classes and irreducible characters. Non-commutative table algebras were introduced in [5].… Expand

Distance-regular graphs, Electron

- J. Combin. (2016)
- 2016

Commutative weakly distance-regular digraphs of circle with fixed length

- Mathematics, Computer Science
- Ars Comb.
- 2011