Primitive weakly distance-regular circulant digraphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DESFXEU6record.jsonopen to challenge →
classification
math.CO
keywords
circulantdigraphsdistance-regularprimitiveweaklyapplicationassociationcertain
read the original abstract
We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.
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.