On super‐edge‐connected digraphs and bipartite digraphs
Miquel Àngel Fiol · Journal of Graph Theory · 1992
Abstract A maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diameter and minimum degree. Similar results are also given for bipartite digraphs. As a corollary, some characterizations of super‐λ graphs and bipartite graphs are obtained. © 1929 John Wiley & Sons, Inc.