Minimum edge cuts of distance-regular and strongly regular digraphs

arXiv1702.01253MaRDI QIDQ6282797FDOQ6282797

Authors: Saleh Ashkboos, G. R. Omidi, Fateme Shafiei, Khosro Tajbakhsh 

Publication date: 4 February 2017

Abstract: In this paper, we show that the edge connectivity of a distance-regular digraph $Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover we show that the same result holds for strongly regular digraphs. These results extend the same known results for undirected case with quite different proofs.

This page was built for publication: Minimum edge cuts of distance-regular and strongly regular digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282797)