Embedding a ring in a hypercube with both faulty links and faulty nodes
From MaRDI portal
Publication:671607
DOI10.1016/0020-0190(96)00114-7zbMath0875.68149OpenAlexW2067820020MaRDI QIDQ671607
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
Related Items (18)
Longest fault-free paths in hypercubes with vertex faults ⋮ On ring embedding in hypercubes with faulty nodes and links ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Embedding longest fault-free paths in arrangement graphs with faulty vertices ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Embedded paths and cycles in faulty hypercubes ⋮ Hamiltonicity of hypercubes with a constraint of required and faulty edges ⋮ Panconnectivity for interconnection networks with faulty elements ⋮ Shaped lattice graphs as models of the multiprocessor computer systems ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs ⋮ Long paths in hypercubes with conditional node-faults ⋮ Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) ⋮ Survey on path and cycle embedding in some networks ⋮ The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
Cites Work
This page was built for publication: Embedding a ring in a hypercube with both faulty links and faulty nodes
