✦ LIBER ✦

The superconnectivity of large digraphs and graphs

✍ Scribed by M.A. Fiol

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 696 KB
Volume: 124
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00051-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the superconnectivity and the conditi

On the superconnectivity and the conditional diameter of graphs and digraphs

✍ Carmona, A.; F�brega, J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

It has been proved that if the diameter D of a digraph G satisfies D Յ 2ᐉ Ϫ 2, where ᐉ is a parameter which can be thought of as a generalization of the girth of a graph, then G is superconnected. Analogously, if D Յ 2ᐉ Ϫ 1, then G is edge-superconnected. In this paper, we studied some similar condi

Superconnected digraphs and graphs with

Superconnected digraphs and graphs with small conditional diameters

✍ C. Balbuena; J. Fàbrega; X. Marcote; I. Pelayo 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

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

Catalogues of graphs and digraphs

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 81 KB

We have recently completed the computer generation of a catalogue of all the 12,(b05,168 unlabelled graphs on 10 vertices, and are willing to make this catalogue available to those interested. The catalogue consists of two magnetic tapes; one contains all ten-vertex graphs on up to 20 edges, the ot

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

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