Semicomplete multipartite weakly distance-regular digraphs
Combinatorics
2025-01-22 v1
Abstract
A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, J{\o}rgensen et al. \cite{JG14} initiated the study of doubly regular team tournaments. As a natural extension, we introduce doubly regular team semicomplete multipartite digraphs and show that such digraphs fall into three types. Furthermore, we give a characterization of all semicomplete multipartite commutative weakly distance-regular digraphs.
Cite
@article{arxiv.2501.10921,
title = {Semicomplete multipartite weakly distance-regular digraphs},
author = {Shuang Li and Yuefeng Yang and Kaishun Wang},
journal= {arXiv preprint arXiv:2501.10921},
year = {2025}
}