✦ LIBER ✦

Diameter-vulnerability of large bipartite digraphs

✍ Scribed by C. Padró; P. Morillo; E. Llobet

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 713 KB
Volume: 64
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00127-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diameter vulnerability of iterated line

Diameter vulnerability of iterated line digraphs

✍ C. Padró; P. Morillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 823 KB

Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For a

On the diameter vulnerability of Kautz d

On the diameter vulnerability of Kautz digraphs

✍ D.Z. Du; D.F. Hsu; Y.D. Lyuu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We show that in the Kautz digraph K(d, t) with d' + d'-1 vertices each having out degree d, there exist d vertex-disjoint paths between any pair of distinct vertices, one of length at most t, d -2 of length at most t + 1, and one of length at most t + 2.

Connectivity of large bipartite digraphs

Connectivity of large bipartite digraphs and graphs

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

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu

Large (d, D, D′, s)-bipartite digraphs

✍ J. Gómez; P. Morillo; C. Padró 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Diameter vulnerability of iterated line

Diameter vulnerability of iterated line digraphs in terms of the girth

✍ C. Balbuena; X. Marcote; D. Ferrero 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

Large bipartite graphs with given degree

Large bipartite graphs with given degree and diameter

✍ C. Delorme 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 1 views

W e give constructions of bipartite graphs with maximum A, diameter D on B vertices. such :bat for every D 3 2 :he !im i nf , . . , B . A'"' = b,, > 0. W e also improve similar results on ordinary graphs, for example, w e prove that lim, , , N -A-." = 1 if D is 3 or 5. This is a partial answer to a