On the diameter vulnerability of Kautz digraphs

DOI10.1016/0012-365X(94)00084-VzbMath0853.05043OpenAlexW1964445598MaRDI QIDQ1916380

Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu

Publication date: 9 December 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00084-v

zbMATH Keywords

Kautz digraphdiameter vulnerabilityvertex disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

Fault diameter of Cartesian product graphs, Edge, vertex and mixed fault diameters, Fault-diameter of Cartesian graph bundles, The vulnerability of the diameter of the enhanced hypercubes, Edge-fault diameter of \(C_4\)-free graphs, Fault-tolerant diameter for three family interconnection networks, Mixed fault diameter of Cartesian graph bundles, Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles, The fault-diameter of Cartesian products, Independent spanning trees with small depths in iterated line digraphs, The independence number for de Bruijn networks and Kautz networks, On large (Δ, D, D, 1)-graphs, The edge fault-diameter of Cartesian graph bundles, Disjoint paths of bounded length in large generalized cycles, Miscellaneous Digraph Classes, Fault-tolerant routing in circulant networks and cycle prefix networks

Cites Work

• Large fault-tolerant interconnection networks