Deza digraphs
Deza digraphs
复制标题
DOI：
10.1016/j.ejc.2005.04.001
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
Kaishun Wang;Yan-Quan Feng
中科院分区：
文献类型：
--
作者：
Kaishun Wang;Yan-Quan Feng
我们考虑Deza图的一个有向版本。有向图称为Deza有向图，如果它是正则的，且任意两个不同顶点的公共外邻域的数目至多为两个值。我们介绍了一些结构，并发展了一些基本理论。特别地，描述了由Cayley有向图、图词典图乘积和图有向乘积构成的有向图。此外，我们刻画了一族正规Deza有向图，并列出了所有至多有6个顶点的循环严格Deza有向图。最后讨论了与弱距离正则有向图的联系，并列出了所有严格Deza有向图，它们也是不超过10个顶点的弱距离正则有向图。
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we characterize a family of normal Deza digraphs, and list all cyclic strictly Deza digraphs with at most six vertices. Finally, connections to weakly distance-regular digraphs are discussed, and all strictly Deza digraphs which are also weakly distance-regular digraphs with at most ten vertices are listed.