Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
On the k-diameter of k-regular k-connected graphs
Discrete Mathematics
A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
Information Processing Letters
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Recognizing Cartesian graph bundles
Discrete Mathematics
Multiplicative circulant networks topological properties and communication algorithms
Discrete Applied Mathematics
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
On recognizing Cartesian graph bundles
Discrete Mathematics
Unique square property and fundamental factorizations of graph bundles
Discrete Mathematics - Algebraic and topological methods in graph theory
Algorithm for recognizing Cartesian graph bundles
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Computing vertex connectivity: new bounds from old techniques
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Fault-diameter of Cartesian graph bundles
Information Processing Letters
Fault diameter of product graphs
Information Processing Letters
IEEE Transactions on Computers
The edge fault-diameter of Cartesian graph bundles
European Journal of Combinatorics
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Fault diameter of Cartesian product graphs
Information Processing Letters
Edge fault-diameter of Cartesian product of graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Edge fault-diameter of graph product
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
| Hi-index | 0.02 |
Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. Fault diameters are diameters of a graph after some of its elements (vertices, edges, or both) are deleted. Cartesian graph products and Cartesian graph bundles are among frequently studied interconnection network topologies. A brief survey of results on fault tolerance parameters of these graph families is given.