Locally semicomplete weakly distance-regular digraphs
Combinatorics
2024-09-12 v2
Abstract
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 a semicomplete digraph. In this paper, we characterize all locally semicomplete weakly distance-regular digraphs under the assumption of commutativity.
Cite
@article{arxiv.2405.03310,
title = {Locally semicomplete weakly distance-regular digraphs},
author = {Yuefeng Yang and Shuang Li and Kaishun Wang},
journal= {arXiv preprint arXiv:2405.03310},
year = {2024}
}