Semicomplete multipartite weakly distance-regular digraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910789744459776 |
|---|---|
| author | Li, Shuang Yang, Yuefeng Wang, Kaishun |
| author_facet | Li, Shuang Yang, Yuefeng Wang, Kaishun |
| contents | 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{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_10921 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Semicomplete multipartite weakly distance-regular digraphs Li, Shuang Yang, Yuefeng Wang, Kaishun Combinatorics 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{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. |
| title | Semicomplete multipartite weakly distance-regular digraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.10921 |