On 3-equivalenced weakly distance-regular digraphs
classification
🧮 math.CO
keywords
equivalenceddigraphsdistance-regularweaklyassociationassumptionattachedclassify
read the original abstract
A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumption of the commutativity.
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.