Locally semicomplete weakly distance-regular digraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917773611892736 |
|---|---|
| author | Yang, Yuefeng Li, Shuang Wang, Kaishun |
| author_facet | Yang, Yuefeng Li, Shuang Wang, Kaishun |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_03310 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Locally semicomplete weakly distance-regular digraphs Yang, Yuefeng Li, Shuang Wang, Kaishun Combinatorics 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. |
| title | Locally semicomplete weakly distance-regular digraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2405.03310 |