𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The constructive characterization of (κ,ℓ)-edge-connected digraphs

✍ Scribed by Erika R. Kovács; László A. Végh

Book ID
106167789
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
320 KB
Volume
31
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Testingk-edge-connectivity of digraphs
Testingk-edge-connectivity of digraphs
✍ Yuichi Yoshida; Hiro Ito 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 235 KB
Highly edge-connected detachments of gra
Highly edge-connected detachments of graphs and digraphs
✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ → __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by ‘splitting’ each vertex ν ∈ __V__ into __r__(ν) vertices. The vertices ν~1~,…,ν~__r__(ν)~ obtained by splitting ν are called the __pieces__ of ν in __H

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