Normally Regular Digraphs

Electronic Journal Of Combinatorics

Leif K Jørgensen¹ 

关键词: Directed graphs;    Design theory;    Association schemes;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$, a pair of non-

【 授权许可】

Others