2 papers
math.CO2025
Semicomplete multipartite weakly distance-regular digraphs
Shuang Li, Yuefeng Yang, Kaishun Wang
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. \cite{JG1…
math.CO2024
Locally semicomplete weakly distance-regular digraphs
Yuefeng Yang, Shuang Li, Kaishun Wang
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces…