Edge-fault-tolerant node-pancyclicity of twisted cubes
From MaRDI portal
Publication:990961
DOI10.1016/j.ipl.2009.08.007zbMath1206.68044OpenAlexW2021132367MaRDI QIDQ990961
Publication date: 1 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.007
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
Paths and cycles identifying vertices in twisted cubes, Constructing edge-disjoint spanning trees in twisted cubes, DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph, Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, Edge-fault-tolerant vertex-pancyclicity of augmented cubes, Fault-tolerant embedding of meshes/tori in twisted cubes, A parallel algorithm for constructing independent spanning trees in twisted cubes, Embedding of tori and grids into twisted cubes
Cites Work
- Fault-tolerant Hamiltonicity of twisted cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Optimal fault-tolerant embedding of paths in twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- A note on cycle embedding in folded hypercubes with faulty elements
- Cycle embedding of augmented cubes
- Edge-pancyclicity of Möbius cubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Vertex pancyclic graphs
- Topological properties of twisted cube
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Cycle and Path Embedding on 5-ary N-cubes
