Quasi-thin weakly distance-regular digraphs,I
Combinatorics
2016-09-20 v2
Abstract
A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.
Cite
@article{arxiv.1606.03521,
title = {Quasi-thin weakly distance-regular digraphs,I},
author = {Yuefeng Yang and Benjian Lv and Kaishun Wang},
journal= {arXiv preprint arXiv:1606.03521},
year = {2016}
}
Comments
This paper has been withdrawn by the author because the result of this paper has been added in another paper