Fault diameter of Cartesian product graphs
From MaRDI portal
Publication:835042
DOI10.1016/j.ipl.2004.11.005zbMath1169.05319OpenAlexW2097129224MaRDI QIDQ835042
Jun-Ming Xu, Min Xu, Xin Min Hou
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.005
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Fault detection; testing in circuits and networks (94C12) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (21)
Decomposition of the product of cycles based on degree partition ⋮ Edge, vertex and mixed fault diameters ⋮ Fault-diameter of Cartesian graph bundles ⋮ Fault diameter of product graphs ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ Factorizations of the product of cycles ⋮ Existence of 3-regular subgraphs in Cartesian product of cycles ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ On 4-regular 4-connected bipancyclic subgraphs of hypercubes ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Resource placement in Cartesian product of networks ⋮ The Optimal Design of Low-Latency Virtual Backbones ⋮ The fault-diameter of Cartesian products ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices ⋮ On regular subgraphs of augmented cubes ⋮ Topological properties on the diameters of the integer simplex ⋮ On conditional connectivity of the Cartesian product of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Fault diameter of interconnection networks
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
- On connectivity of the cartesian product of two graphs
- Wide diameters of butterfly networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- On the diameter vulnerability of Kautz digraphs
- On the Rabin number problem
This page was built for publication: Fault diameter of Cartesian product graphs
