Quasi-thin weakly distance-regular digraphs
- 13 Downloads
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 such digraphs with valency more than 3. As a result, this family of digraphs is completely determined.
KeywordsWeakly distance-regular digraph Quasi-thin Cayley digraph
Mathematics Subject Classification05E30
Y. Yang is supported by the Fundamental Research Funds for the Central Universities (Grant No. 2652017141), B. Lv is supported by NSFC (11501036), and K. Wang is supported by NSFC (11671043).
- 3.Hanaki, A.: Classification of weakly distance-regular digraphs with up to 21 vertices, http://math.shinshu-u.ac.jp/~hanaki/as/data/wdrdg (2000)
- 10.Yang, Y., Lv, B., Wang, K.: Weakly distance-regular digraphs of valency three, I. Electron. J. Combin. 23(2) (2016), Paper 2.12Google Scholar
- 12.Zieschang, P.H.: An Algebraic Approach to Association Schemes. In: Lecture Notes in Mathematics, vol. 1628. Springer, Berlin, Heidelberg (1996)Google Scholar