Primitive weakly distance-regular circulant digraphs
Combinatorics
2019-08-26 v1
Abstract
We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.
Keywords
Cite
@article{arxiv.1908.08658,
title = {Primitive weakly distance-regular circulant digraphs},
author = {Akihiro Munemasa and Kaishun Wang and Yuefeng Yang},
journal= {arXiv preprint arXiv:1908.08658},
year = {2019}
}
Comments
11 pages