On 3-equivalenced weakly distance-regular digraphs
Combinatorics
2017-08-01 v2
Abstract
A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumption of the commutativity.
Keywords
Cite
@article{arxiv.1705.00798,
title = {On 3-equivalenced weakly distance-regular digraphs},
author = {Yuefeng Yang and Benjian Lv and Kaishun Wang},
journal= {arXiv preprint arXiv:1705.00798},
year = {2017}
}
Comments
The main theorem of this paper can be proved by other paper's result easily