Edge fault-diameter of graph product

Authors:
Janez Žerovnik
Affiliations:
Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia and University of Ljubljana, Faculty of Mechanical Engineering, Ljubljana, Slovenia
Venue:
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Year:
2010

Citing 9
Cited 1

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
Multiplicative circulant networks topological properties and communication algorithms

Discrete Applied Mathematics
Reliability of interconnection networks modeled by a product of graphs

Networks
Fault-diameter of Cartesian graph bundles

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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The product graph B * F of graphs B and F is an interesting model in the design of large reliable networks. Let G be a kG-edge connected graph and DcE(G) be the largest diameter of subgraphs of G obtained by deleting c kG edges. We prove that Da+b+1E(B * F) ≤ DaE (F) + DbE (B) + 1 where a F, and b B.