Fault-diameter of Cartesian graph bundles

Authors:
Iztok Banič;Janez Žerovnik
Affiliations:
FME, University of Maribor, Smetanova, Maribor, Slovenia;FME, University of Maribor, Smetanova, Maribor, Slovenia and Institute of Mathematics, Physics and Mechanics, Jadranska, Ljubljana, Slovenia
Venue:
Information Processing Letters
Year:
2006

Citing 9
Cited 8

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 generalized twisted cubes

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
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
Algorithm for recognizing Cartesian graph bundles

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Fault diameter of Cartesian product graphs

Information Processing Letters

Fault diameter of product graphs

Information Processing Letters
The edge fault-diameter of Cartesian graph bundles

European Journal of Combinatorics
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
Fault diameters of graph products and bundles

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Fault-tolerant diameter for three family interconnection networks

Journal of Combinatorial Optimization
Mixed fault diameter of Cartesian graph bundles

Discrete Applied Mathematics
Wide-diameter of Product Graphs

Fundamenta Informaticae

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 Da+b+1(G) ≤ Da(F) + Db(B) + 1 if G is a graph bundle with fibre F over base B, a F, and b B.