𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On super-edge-connected digraphs and bipartite digraphs

✍ Scribed by M. A. Fiol

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
524 KB
Volume
16
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 diameter and minimum degree. Similar results are also given for bipartite digraphs. As a corollary, some characterizations of super‐λ graphs and bipartite graphs are obtained. © 1929 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

On Moore bipartite digraphs
On Moore bipartite digraphs
✍ M. A. Fiol; J. Gimbert; J. Gómez; Y. Wu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore‐like bound in terms of its diameter __k__ and the maximum out‐degrees (__d__~1~, __d__~2~) of its partite sets of vertic

Dense bipartite digraphs
Dense bipartite digraphs
✍ M. A. Fiol; J. L. A. Yebra 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract For its implications in the design of interconnection networks, it is interesting to find (a) (di)graphs with given maximum (out‐)degree __d__ and diameter __D__ that have large order; (b) (di)graphs of given order and maximum (out‐)degree __d__ that have small diameter. (Di)graphs o

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

Local Strongly Arc-Connectivity in Regul
Local Strongly Arc-Connectivity in Regular Bipartite Digraphs
✍ J.M. Xu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 99 KB

We show that for any vertex \(x\) of a \(d\)-regular bipartite digraph there are a vertex \(y\), in the other class of the bipartition, and \(d(x, y)\)-paths and \(d(y, x)\)-paths such that all \(2 d\) of them are pairwise arc-disjoint. This result generalizes a theorem of Hamidoune and Las Vergnas

Maximally connected digraphs
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