Minimum edge cuts of distance-regular and strongly regular digraphs
Combinatorics
2017-02-07 v1
Abstract
In this paper, we show that the edge connectivity of a distance-regular digraph with valency is and for , any minimum edge cut of 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.
Keywords
Cite
@article{arxiv.1702.01253,
title = {Minimum edge cuts of distance-regular and strongly regular digraphs},
author = {S. Ashkboos and G. R. Omidi and F. Shafiei and K. Tajbakhsh},
journal= {arXiv preprint arXiv:1702.01253},
year = {2017}
}
Comments
9 pages, 1 figure