{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:44Z","timestamp":1753893824681,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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 $\\Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover, we will show that except for undirected cycles, any distance regular-digraph $\\Gamma$ with diameter $D=2$, degree $k\\leq 3$ or $\\lambda=0$ ($\\lambda$ is the number of 2-paths from $u$ to $v$ for an edge $uv$ of $\\Gamma$) is super vertex-connected, that is, any minimum vertex cut of $\\Gamma$ is the set of all out-neighbors (or in-neighbors) of a single vertex in $\\Gamma$. These results extend the same known results for the undirected case with quite different proofs.<\/jats:p>","DOI":"10.37236\/6167","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:45:12Z","timestamp":1578653112000},"source":"Crossref","is-referenced-by-count":0,"title":["Minimum Cuts of Distance-Regular Digraphs"],"prefix":"10.37236","volume":"24","author":[{"given":"Saleh","family":"Ashkboos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gholamreza","family":"Omidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fateme","family":"Shafiei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khosro","family":"Tajbakhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2017,10,6]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p2\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:45:31Z","timestamp":1579218331000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i4p2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,6]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/6167","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,10,6]]},"article-number":"P4.2"}}