On the generalized twisted cube

DOI10.1016/0020-0190(95)00054-GzbMath0875.68142OpenAlexW2074201484MaRDI QIDQ672499

Fouad B. Chedid

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00054-g

zbMATH Keywords

Parallel processingHypercubesMeshes of trees

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (17)

Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Embedding a mesh of trees in the crossed cube ⋮ Edge-fault-tolerant strong Menger edge connectivity on regular graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ Fractional matching preclusion of the restricted HL-graphs ⋮ The bicube: an interconnection of two hypercubes ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Hamiltonian properties on a class of circulant interconnection networks

Cites Work

• Unnamed Item
• A new variation on hypercubes with smaller diameter
• Parallel concepts in graph theory
• The twisted N-cube with application to multiprocessing

This page was built for publication: On the generalized twisted cube