PreprintarXiv licencearXiv
s-quasi-transitive weakly distance-regular digraphs
Abstract
A digraph is s-quasi-transitive if, for every path (x0,x1,…,xs) of length s, either (x0,xs)∈ AΓ or (xs,x0)∈ AΓ (or both). In this paper, we give a characterization of s-quasi-transitive commutative weakly distance-regular digraphs, where s=4, or s≥ 5 and the cycle polar diameter is at least s.
Related
- Quasi-strongly regular digraphs constructed from transitive groups of degree n≤ 110
- Hamiltonicity and cycle factors in k-quasi-transitive digraphs of large diameter
- The Path Partition Conjecture and 3-(quasi-)Transitive Digraphs
- On 2-distance-transitive circulant digraphs
- An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs
BibTeX
@misc{li2026squasitransitive,
title = {{$s$-quasi-transitive weakly distance-regular digraphs}},
author = {Shuang Li and Yuefeng Yang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.07251},
eprint = {2611.07251},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.07251},
}
RIS
TY - UNPB
TI - s-quasi-transitive weakly distance-regular digraphs
AU - Shuang Li
AU - Yuefeng Yang
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.07251
UR - https://arxiv.org/abs/2611.07251
AB - A digraph is s-quasi-transitive if, for every path (x_0,x_1,…,x_s) of length s, either (x_0,x_s)∈ AΓ or (x_s,x_0)∈ AΓ (or both). In this paper, we give a characterization of s-quasi-transitive commutative weakly distance-regular digraphs, where s=4, or s≥ 5 and the cycle polar diameter is at least s.
ER -