Quasi-thin weakly distance-regular digraphs
Combinatorics
2018-10-01 v3
Abstract
A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined.
Keywords
Cite
@article{arxiv.1609.04962,
title = {Quasi-thin weakly distance-regular digraphs},
author = {Yuefeng Yang and Benjian Lv and Kaishun Wang},
journal= {arXiv preprint arXiv:1609.04962},
year = {2018}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1606.03521