Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
From MaRDI portal
Publication:2385484
Recommendations
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Hamiltonian cycles in hypercubes with more faulty edges
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Cites work
- 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 a ring in a hypercube with both faulty links and faulty nodes
- 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
- Generalized diameters and Rabin numbers of networks
- Hamiltonian-laceability of star graphs
- Hamiltonicity of the hierarchical cubic network
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Longest fault-free paths in star graphs with vertex faults
- Mutually independent hamiltonian paths in star networks
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- Wide diameters of Cartesian product graphs and digraphs
Cited in
(20)- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
- Characterizations of optimal component cuts of locally twisted cubes
- Fault-free mutually independent Hamiltonian cycles of faulty star graphs
- Paired many-to-many disjoint path covers in faulty hypercubes
- Independent spanning trees on twisted cubes
- Path embeddings with prescribed edge in the balanced hypercube network
- The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Modelling simultaneous broadcasting by level-disjoint partitions
- The fault tolerance of \(( n , k )\)-bubble-sort networks
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
- Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
- Rooted level-disjoint partitions of Cartesian products
- Matching preclusion number in product graphs
This page was built for publication: Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385484)
