Semicomplete multipartite weakly distance-regular digraphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WU5PPEFNrecord.jsonopen to challenge →
classification
math.CO
keywords
multipartitedigraphssemicompletedistance-regulardoublygraphregularteam
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.