✦ LIBER ✦

Diameter vulnerability of graphs

✍ Scribed by C. Peyrat

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 344 KB
Volume: 9
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90024-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diameter vulnerability of GC graphs

✍ J. Gómez; I. Pelayo; C. Balbuena 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Concern over fault tolerance in the design of interconnection networks has stimulated interest in ÿnding large graphs with maximum degree and diameter D such that the subgraphs obtained by deleting any set of s vertices have diameter at most D , this value being close to D or even equal to it. This

Vulnerability in graphs of diameter four

✍ Geoffrey Exoo; Frank Harary; Cheng-De Xu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 285 KB

The analogue of Menger's Theorem on connectivity has been investigated for graphs of low diameter in which the removal of a set of lines increases the diameter. When the diameter is at most three, such a theorem has been proven already. Also, examples have been constructed to show that the result do

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

Diameter-vulnerability of large bipartit

Diameter-vulnerability of large bipartite digraphs

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

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.

Edge vulnerability parameters of bisplit

Edge vulnerability parameters of bisplit graphs

✍ Metrose Metsidik; Elkin Vumar 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 260 KB

A graph is called bisplit if its vertex set can be partitioned into three stable sets I, Y and Z such that Y ∪ Z induces a complete bipartite graph (a biclique). In this paper, we investigate the edge vulnerability parameters of bisplit graphs. Let G = (Y ∪ Z , I, E) be a noncomplete connected bispl