Recognition: unknown
Quasi-thin weakly distance-regular digraphs
classification
🧮 math.CO
keywords
digraphsdistance-regularquasi-thinweaklyclassifycommutativecompletelydetermined
read the original abstract
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 are completely determined.
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.