Weakly distance-regular digraphs whose underlying graphs are distance-regular,II

2024/08/06 by Zeng, Qing, Yang, Yuefeng, Wang, Kaishun
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2408.02931

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.

Related

• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
• Weakly distance-regular digraphs of diameter 2
• Quasi-thin weakly distance-regular digraphs
• Thick weakly distance-regular digraphs
• Locally semicomplete weakly distance-regular digraphs