On ring embedding in hypercubes with faulty nodes and links
DOI10.1016/S0020-0190(98)00159-8zbMATH Open1339.68213OpenAlexW2016961663MaRDI QIDQ293450FDOQ293450
Authors: Abhijit Sengupta
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
Cited In (22)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Survey on path and cycle embedding in some networks
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
- Ring embedding in faulty pancake graphs
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Hamiltonian paths with prescribed edges in hypercubes
- On some super fault-tolerant Hamiltonian graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Hamiltonicity of hypercubes with a constraint of required and faulty edges
- Panconnectivity for interconnection networks with faulty elements
- A note on cycle embedding in hypercubes with faulty vertices
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- On embedding cycles into faulty twisted cubes
- Fault-tolerant cycles embedding in folded hypercubes
- A recursively construction scheme for super fault-tolerant Hamiltonian graphs
- Long paths and cycles in hypercubes with faulty vertices
This page was built for publication: On ring embedding in hypercubes with faulty nodes and links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293450)