Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation
Graph Theory With Applications
Graph Theory With Applications
Fault-diameter of Cartesian graph bundles
Information Processing Letters
Fault diameter of product graphs
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Fault diameter of Cartesian product graphs
Information Processing Letters
| Hi-index | 0.00 |
Let G=(V,E) be an k-connected graph. The (k驴1)-fault-tolerant diameter of G, denoted by D k (G), is defined as D k (G)=max驴{d(G驴F)|F驴V(G) and |F|=k驴1}, where G驴F denotes the subgraph induced by V(G)驴F. The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. In this paper, we will give the bounds of fault-tolerant diameter of three family interconnection networks.