𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New bounds on the diameter vulnerability of iterated line digraphs

✍ Scribed by Daniela Ferrero; Carles Padró

Book ID
108315535
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
113 KB
Volume
233
Category
Article
ISSN
0012-365X

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.