REVIEW
On 3-equivalenced weakly distance-regular digraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.