Minimum Cuts of Distance-Regular Digraphs

Electronic Journal Of Combinatorics

Saleh Ashkboos¹ 

关键词: Distance-regular digraphs;    Strongly regular digraphs;    Minimum cuts;    Connectivity;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In this paper, we investigate the structure of minimum vertex and edge cuts of distance-regular digraphs. We show that each distance-regular digraph $\Gamma$, different from an undirected cycle, is super edge-connected, that is, any minimum edge cut of $\

【 授权许可】

Others