Fault diameter of Cartesian product graphs

Authors:
Min Xu;Jun-Ming Xu;Xin-Min Hou
Affiliations:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China
Venue:
Information Processing Letters
Year:
2005

Fault diameter of interconnection networks

Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
On the diameter vulnerability of Kautz digraphs

Discrete Mathematics - Special issue on graph theory and combinatorics
The Cross Product of Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
On connectivity of the Cartesian product of two graphs

Applied Mathematics and Computation
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Fault-diameter of Cartesian graph bundles

Information Processing Letters
Fault diameter of product graphs

Information Processing Letters
Capturing an intruder in product networks

Journal of Parallel and Distributed Computing
The edge fault-diameter of Cartesian graph bundles

European Journal of Combinatorics
Resource placement in Cartesian product of networks

Journal of Parallel and Distributed Computing
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
Capturing an intruder in product networks

HiPC'06 Proceedings of the 13th international conference on High Performance Computing
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

Hi-index	0.89

The (k-1)-fault diameter D"k(G) of a k-connected graph G is the maximum diameter of G-F for any F@?V(G) with |F|=1 for i=1,2.