Scifaro

中文

拟薄弱距离正则有向图，I

组合数学 2016-09-20 v2

作者: Yuefeng Yang , Benjian Lv , Kaishun Wang

在 arXiv 上查看 ↗ PDF ↗

摘要

若弱距离正则有向图的交集数最大值为2，则称其为拟薄的。本文证明，任意交换拟薄弱距离正则有向图的度至多为6。

关键词

弱距离正则有向图拟薄交集数交换度

引用

@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}
}

备注

This paper has been withdrawn by the author because the result of this paper has been added in another paper