✦ LIBER ✦

Connectivity of consecutive-d digraphs

✍ Scribed by D.-Z Du; D.F Hsu; G.W Peck

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 920 KB
Volume: 37-38
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90131-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Hamiltonian property of consecutive-

The Hamiltonian property of consecutive-d digraphs

✍ D.Z. Du; D.F. Hsu; F.K. Hwang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Connectivity in digraphs

✍ L Lovász 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 185 KB

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.

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

The connectivity of hierarchical Cayley

The connectivity of hierarchical Cayley digraphs

✍ Y.O. Hamidoune; A.S. Llado; O. Serra 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 569 KB

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