Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
From MaRDI portal
Publication:733731
Recommendations
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
Cites work
- scientific article; zbMATH DE number 54299 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3641471 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Embedding cube-connected cycles graphs into faulty hypercubes
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Hamiltonian-laceability of star graphs
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Longest fault-free paths in star graphs with vertex faults
Cited in
(23)- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
- Two spanning disjoint paths with required length in generalized hypercubes
- Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
- Independent spanning trees on twisted cubes
- Hamiltonian decomposition of generalized recursive circulant graphs
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Embedding multidimensional grids into optimal hypercubes
- Modelling simultaneous broadcasting by level-disjoint partitions
- Hamiltonian paths in hypercubes with local traps
- Rooted level-disjoint partitions of Cartesian products
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Mutually independent bipanconnected property of hypercube
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Diameter variability of hypercubes
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- Paired many-to-many disjoint path covers in faulty hypercubes
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
This page was built for publication: Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733731)
