Degree sequence conditions for maximally edge-connected oriented graphs Original Research Article

If DD is a digraph, δ(D)δ(D) its minimum degree and λ(D)λ(D) its edge-connectivity, then λ(D)≤δ(D)λ(D)≤δ(D). A digraph DD is called maximally edge-connected if λ(D)=δ(D)λ(D)=δ(D). A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be maximally edge-connected have been given by several authors. However, closely related conditions for maximally edge-connected oriented graphs have received little attention until recently. In this work we will present some degree sequence conditions for oriented graphs as well as for oriented bipartite graphs to be maximally edge-connected.