Semicomplete multipartite weakly distance-regular digraphs
Abstract
A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, Jrgensen et al. 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.