Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
Combinatorics
2024-08-07 v1
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.
Keywords
Cite
@article{arxiv.2408.02931,
title = {Weakly distance-regular digraphs whose underlying graphs are distance-regular,II},
author = {Qing Zeng and Yuefeng Yang and Kaishun Wang},
journal= {arXiv preprint arXiv:2408.02931},
year = {2024}
}