𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the distance connectivity of graphs and digraphs

✍ Scribed by M.A. Fiol; J. Fàbrega

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
475 KB
Volume
125
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be thought of as a generalization of the girth of a graph. For instance, it is proved that G is maximally connected iff either 0<21-1 or ~(21) > 6. As a corollary, similar results for (undirected) graphs are derived.

📜 SIMILAR VOLUMES

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

The connectivity of large digraphs and g
The connectivity of large digraphs and graphs
✍ M. A. Fiol 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 632 KB

## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree δ, maximum degree Δ, diameter __D__, and a new parameter l~pi;~, __0__ ≤ π ≤ δ − 2, related with the number of short paths (in the case of graphs

Connectivity of distance graphs
Connectivity of distance graphs
✍ J.D. Currie 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Currie, J.D., Connectivity of distance graphs, Discrete Mathematics 103 (1992) 91-94. The author shows the following: Let K 2 Q be a H-module. Let G be a graph with vertex set V, a K-space. Suppose that edges of G are preserved under translations in V. Then if G has more than one connected componen

On the connectivity and the conditional
On the connectivity and the conditional diameter of graphs and digraphs
✍ Balbuena, C.; Carmona, A.; F�brega, J.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB

Recently, it was proved that if the diameter D of a graph G is small enough in comparison with its girth, then G is maximally connected and that a similar result also holds for digraphs. More precisely, if the diameter D of a digraph G satisfies D 5 21 -1, then G has maximum connectivity ( K = 6 ) .