✦ LIBER ✦

On the connectivity of randomm-orientable graphs and digraphs

✍ Scribed by T. I. Fenner; A. M. Frieze

Book ID: 110564470
Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 475 KB
Volume: 2
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579431

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the distance connectivity of graphs a

On the distance connectivity of graphs and digraphs

✍ M.A. Fiol; J. Fàbrega 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 475 KB

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

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

On computing the connectivities of graph

On computing the connectivities of graphs and digraphs

✍ Abdol H. Esfahanian; S. Louis Hakimi 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 670 KB

Super Connectivity of Line Graphs and Di

Super Connectivity of Line Graphs and Digraphs

✍ Min Lü; Jun-Ming Xu 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 121 KB

Connectivity of large bipartite digraphs

Connectivity of large bipartite digraphs and graphs

✍ M.C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu

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 ) .