𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a property ofn-edge-connected digraphs

✍ Scribed by W. Mader

Book ID
110564499
Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
112 KB
Volume
1
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On super-edge-connected digraphs and bip
On super-edge-connected digraphs and bipartite digraphs
✍ M. A. Fiol πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 524 KB

## 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 diamet

The number of vertices of degree k in a
The number of vertices of degree k in a minimally k-edge-connected digraph
✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 298 KB πŸ‘ 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdâs is Eigh