The twisted N-cube with application to multiprocessing

DOI10.1109/12.67323MaRDI QIDQ5375382zbMATH OpenOpenAlexFDO

Authors Abdol-Hossein Esfahanian, Lionel M. Ni, 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

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cited in

(34)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375382)