Embedding a ring in a hypercube with both faulty links and faulty nodes

DOI10.1016/0020-0190(96)00114-7MaRDI QIDQ671607zbMATHOpenAlexFDO

Authors Yu-Chee Tseng

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0020-0190(96)00114-7

zbMATH Keywords

Parallel processingFault toleranceGraph embeddingHypercubeInterconnection networkRing

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• On ring embedding in hypercubes with faulty nodes and links
• scientific article; zbMATH DE number 5670007
• Fault-tolerant cycle embedding in the faulty hypercubes
• Fault-tolerant cycle embedding in the hypercube
• Cycles embedding in hypercubes with node failures

Cites work

• On the embedding of a class of regular graphs in a faulty hypercube

Cited in

(18)

• Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
• Embedded paths and cycles in faulty hypercubes
• Survey on path and cycle embedding in some networks
• Long cycles in hypercubes with optimal number of faulty vertices
• Longest fault-free paths in hypercubes with vertex faults
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• A note on cycle embedding in hypercubes with faulty vertices
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
• Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
• Panconnectivity for interconnection networks with faulty elements
• Paired many-to-many disjoint path covers in faulty hypercubes
• Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
• On ring embedding in hypercubes with faulty nodes and links
• Long paths in hypercubes with conditional node-faults
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Shaped lattice graphs as models of the multiprocessor computer systems
• Long paths and cycles in hypercubes with faulty vertices

This page was built for publication: Embedding a ring in a hypercube with both faulty links and faulty nodes

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