A digraph is a primitive weakly distance-regular circulant exactly when it is a Paley digraph of prime order p with p congruent to 3 mod 4, a prime-length circuit, or Cay(Z13,{1,3,9}).
Suzuki, Thin weakly distance-regular digraphs, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Primitive weakly distance-regular circulant digraphs
A digraph is a primitive weakly distance-regular circulant exactly when it is a Paley digraph of prime order p with p congruent to 3 mod 4, a prime-length circuit, or Cay(Z13,{1,3,9}).