✦ LIBER ✦

Highly connected non-2-linked digraphs

✍ Scribed by Carsten Thomassen

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 158 KB
Volume: 11
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01275674

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super link-connectivity of iterated line

Super link-connectivity of iterated line digraphs

✍ Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo; Lu Ruan; Jianhua Sun; Weili W 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this pape

Highly edge-connected detachments of gra

Highly edge-connected detachments of graphs and digraphs

✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ → __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by ‘splitting’ each vertex ν ∈ __V__ into __r__(ν) vertices. The vertices ν~1~,…,ν~__r__(ν)~ obtained by splitting ν are called the __pieces__ of ν in __H

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

On critically connected digraphs

✍ W. Mader 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 481 KB

On super-edge-connected digraphs and bip

On super-edge-connected digraphs and bipartite digraphs

✍ M. A. Fiol 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 524 KB

## Abstract A maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diamet

Connectivity in digraphs

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