On ring embedding in hypercubes with faulty nodes and links
From MaRDI portal
Publication:293450
DOI10.1016/S0020-0190(98)00159-8zbMath1339.68213OpenAlexW2016961663MaRDI QIDQ293450
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00159-8
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (19)
Hamiltonian paths with prescribed edges in hypercubes ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ On some super fault-tolerant Hamiltonian graphs ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube ⋮ Hamiltonicity of hypercubes with a constraint of required and faulty edges ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges ⋮ Panconnectivity for interconnection networks with faulty elements ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ On embedding cycles into faulty twisted cubes ⋮ A recursively construction scheme for super fault-tolerant Hamiltonian graphs ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes
Cites Work
This page was built for publication: On ring embedding in hypercubes with faulty nodes and links
