Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909280510148608 |
|---|---|
| author | Zeng, Qing Yang, Yuefeng Wang, Kaishun |
| author_facet | Zeng, Qing Yang, Yuefeng Wang, Kaishun |
| contents | Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson graphs or folded Johnson graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_02931 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Weakly distance-regular digraphs whose underlying graphs are distance-regular,II Zeng, Qing Yang, Yuefeng Wang, Kaishun Combinatorics Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson graphs or folded Johnson graphs. |
| title | Weakly distance-regular digraphs whose underlying graphs are distance-regular,II |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.02931 |