Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
DOI10.1007/S10878-006-9018-4zbMATH Open1125.05059OpenAlexW1969792866MaRDI QIDQ2385484FDOQ2385484
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9018-4
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
Hamiltonianhypercubesgraph-theoretic interconnection networksfault-tolerant embeddingmutually independent Hamiltonian cycles
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Generalized diameters and Rabin numbers of networks
- Hamiltonian-laceability of star graphs
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Title not available (Why is that?)
- Embedding cube-connected cycles graphs into faulty hypercubes
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Longest fault-free paths in star graphs with vertex faults
- Title not available (Why is that?)
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- Hamiltonicity of the hierarchical cubic network
- Mutually independent hamiltonian paths in star networks
- Wide diameters of Cartesian product graphs and digraphs
Cited In (20)
- 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
- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
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)
