The twisted N-cube with application to multiprocessing

DOI10.1109/12.67323zbMath1395.05139OpenAlexW2101070933MaRDI QIDQ5375382

Lionel M. Ni, Abdol-Hossein Esfahanian, Bruce E. Sagan

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.67323

Mathematics Subject Classification ID

Related Items (34)

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes ⋮ Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Connectivity of the crossed cube ⋮ Edge fault tolerance analysis of a class of interconnection networks ⋮ Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ Fault-tolerant analysis of a class of networks ⋮ Hamiltonian properties on the class of hypercube-like networks ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ Cycles embedding on folded hypercubes with faulty nodes ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ On the generalized twisted cube ⋮ On generalized twisted cubes ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Randomly twisted hypercubes ⋮ A new variation on hypercubes with smaller diameter ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ Strong Menger connectivity with conditional faults on the class of hypercube-like networks ⋮ The two-equal-disjoint path cover problem of matching composition network ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ A further result on fault-free cycles in faulty folded hypercubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ Recursive circulants and their embeddings among hypercubes ⋮ Minimum neighborhood in a generalized cube ⋮ Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant

This page was built for publication: The twisted N-cube with application to multiprocessing