Recognition: unknown
Quasi-thin weakly distance-regular digraphs,I
classification
🧮 math.CO
keywords
distance-regularquasi-thinweaklydigraphcommutativedigraphsintersectionmaximum
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 show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.
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.