Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OOCAHJO4record.jsonopen to challenge →
classification
math.CO
keywords
graphsdistance-regulardigraphsweaklyunderlyingwhosecommutativefolded
read the original abstract
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson graphs or folded Johnson graphs.
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.