Combinatorial analysis of the fault-diameter of the n-cube

DOI10.1109/12.192211zbMath1395.68054OpenAlexW2139923218MaRDI QIDQ5375304

Shahram Latifi

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.192211

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

On fault-tolerant fixed routing in hypercubes ⋮ Edge fault tolerance analysis of a class of interconnection networks ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ Conditional fault diameter of crossed cubes ⋮ Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ The generalized 4-connectivity of hypercubes ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ On the fault-diameter of the star graph ⋮ The 3-path-connectivity of the hypercubes

This page was built for publication: Combinatorial analysis of the fault-diameter of the n-cube