𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity in digraphs

✍ Scribed by L Lovász

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
185 KB
Volume
15
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity of circulant digraphs
Connectivity of circulant digraphs
✍ Erik A. Van Doorn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

An explicit expression is derived for the connectivity of circulant digraphs.

Distance connectivity in graphs and digr
Distance connectivity in graphs and digraphs
✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

Maximally connected digraphs
Maximally connected digraphs
✍ J. Fàbrega; M. A. Fiol 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

This paper introduces a new parameter / = / ( G ) for a loopless digraph G, which can be thought of as a generalization of the girth of a graph. Let K, A, 6, and D denote respectively the connectivity, arc-connectivity, minimum degree, and diameter of G. Then it is proved that A = 6 if D s 21 and K

Connectivity properties of locally semic
Connectivity properties of locally semicomplete digraphs
✍ Yubao Guo; Lutz Volkmann 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

## Abstract It is shown that every __k__‐connected locally semicomplete digraph __D__ with minimum outdegree at least 2__k__ and minimum indegree at least 2__k__ − 2 has at least __m__ = max{2, __k__} vertices __x__~1~, __x__~2~, ⃛, __x__~__m__~ such that __D__ − __x__~__i__~ is __k__‐connected for