✦ LIBER ✦

Extraconnectivity of s-geodetic digraphs and graphs

✍ Scribed by C. Balbuena

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 781 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00163-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extraconnectivity of graphs with large m

Extraconnectivity of graphs with large minimum degree and girth

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

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

Exact colorations of graphs and digraphs

✍ Martin G. Everett; Stephen P. Borgatti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 648 KB

EDGE-CONNECTIVITIES OF GRAPHS AND DIGRAP

EDGE-CONNECTIVITIES OF GRAPHS AND DIGRAPHS

✍ András Frank 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 216 KB

The superconnectivity of large digraphs

The superconnectivity of large digraphs and graphs

✍ M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 696 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