Long paths in hypercubes with conditional node-faults
From MaRDI portal
Publication:1010144
DOI10.1016/J.INS.2008.10.015zbMATH Open1170.68001OpenAlexW2002931942MaRDI QIDQ1010144FDOQ1010144
Authors: Tz-Liang Kueng, Tyne Liang, Lih-Hsing Hsu, Jimmy J. M. Tan 
Publication date: 3 April 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.10.015
Recommendations
Cites Work
- Graph theory
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Title not available (Why is that?)
- Fault-tolerant cycle embedding in the hypercube
- Linear array and ring embeddings in conditional faulty hypercubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- On embedding cycles into faulty twisted cubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Node-disjoint paths in hierarchical hypercube networks
- Longest fault-free paths in hypercubes with vertex faults
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Hamiltonian-laceability of star graphs
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Embedding meshes into crossed cubes
- Title not available (Why is that?)
Cited In (31)
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Conditional edge-fault Hamiltonicity of augmented cubes
- Long cycles in hypercubes with optimal number of faulty vertices
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Fault-tolerant cycle embedding in the faulty hypercubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
- Many-to-many disjoint paths in faulty hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Survey on path and cycle embedding in some networks
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Hamiltonian paths in hypercubes with local traps
- Longest fault-free paths in hypercubes with vertex faults
- The triangular pyramid: Routing and topological properties
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- Computational complexity of long paths and cycles in faulty hypercubes
- The 2-path-bipanconnectivity of hypercubes
- Hamiltonian cycles in hypercubes with faulty edges
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
- Hamiltonian properties on a class of circulant interconnection networks
- The panpositionable panconnectedness of augmented cubes
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- A note on path embedding in crossed cubes with faulty vertices
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
This page was built for publication: Long paths in hypercubes with conditional node-faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010144)
