Semicomplete multipartite weakly distance-regular digraphs

2025/01/19 by Shuang Li, Li, Shuang, Yuefeng Yang +3 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Algebra and Logic #Combinatorics (math.CO) #FOS: Mathematics #Rings, Modules, and Algebras #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2501.10921

openalex publication_date 2025/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, Jørgensen et al. \citeJG14 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.

Cited by

• Weakly distance-regular digraphs of diameter 2

Related

• Locally semicomplete weakly distance-regular digraphs
• Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
• Quasi-thin weakly distance-regular digraphs
• On the pathwidth of almost semicomplete digraphs