Fault diameter of product graphs

Authors:
Jun-Ming Xu;Chao Yang
Affiliations:
Department of Mathematics, University of Science and Technology of China, Hefei 230026, PR China;Department of Mathematics, University of Science and Technology of China, Hefei 230026, PR China
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 4

Fault diameter of interconnection networks

Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Reliability of interconnection networks modeled by a product of graphs

Networks
Fault-diameter of Cartesian graph bundles

Information Processing Letters
Fault diameter of Cartesian product graphs

Information Processing Letters
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

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
Wide-diameter of Product Graphs

Fundamenta Informaticae

Quantified Score

Hi-index	0.89

Visualization

Abstract

The (k-1)-fault diameter D"k(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k-1 vertices from G. This paper considers the fault diameter of the product graph G"1*G"2 of two graphs G"1 and G"2 and proves that D"k"""1"+"k"""2(G"1*G"2)=