Fault diameters of graph products and bundles
نویسنده
چکیده
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. Key–Words: interconnection network, fault tolerance, vertex connectivity, edge connectivity, mixed connectivity, vertex fault-diameter, edge fault-diameter, mixed fault-diameter, wide diameter, Cartesian graph bundle, Cartesian graph product, product graph.
منابع مشابه
Mixed Connectivity of Cartesian Graph Products and Bundles
An interconnection network should be fault tolerant, because practical communication networks are exposed to failures of network components. Both failures of nodes and failures of connections between them happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. A lot of work has been done on various aspects of netwo...
متن کاملImproved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
Mixed fault diameter of a graph G, D(a,b)(G), is the maximal diameter of G after deletion of any a vertices and any b edges. Special cases are the (vertex) fault diameter D a = D(a,0) and the edge fault diameter D E a = D(0,a). Let G be a Cartesian graph bundle with fibre F over the base graph B. We show that (1) D a+b+1(G) ≤ D V a (F )+D V b (B) when the graphs F and B are kF -connected and kB...
متن کاملImproved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
Mixed fault diameter of a graph G, D(a,b)(G), is the maximal diameter of G after deletion of any a vertices and any b edges. Special cases are the (vertex) fault diameter D a = D(a,0) and the edge fault diameter D E a = D(0,a). Let G be a Cartesian graph bundle with fibre F over the base graph B. We show that (1) D a+b+1(G) ≤ D V a (F )+D V b (B) when the graphs F and B are kF -connected and kB...
متن کاملFault-diameter of Cartesian product of graphs and Cartesian graph bundles
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and Dc(G) denote the diameter of G after deleting any of its c < kG vertices. We prove that if G1, G2, . . . , Gq are k1connected, k2-connected,. . . , kq-connected graphs and 0 ≤ a1 < k1, 0 ≤ a2 < k2,. . . , 0 ≤ aq < kq and a = a1 + a2 + . . . + aq + (q − 1), the...
متن کاملAlgorithm for Recognizing Cartesian Graph Bundles
Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that ÿnds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is deÿned and it is shown that any equivalence relation possessing the unique square property determi...
متن کامل