Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
From MaRDI portal
Publication:2385484
DOI10.1007/s10878-006-9018-4zbMath1125.05059MaRDI QIDQ2385484
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
Hamiltonian; hypercubes; fault-tolerant embedding; graph-theoretic interconnection networks; mutually independent Hamiltonian cycles
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
68M15: Reliability, testing and fault tolerance of networks and computer systems
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Paired many-to-many disjoint path covers in faulty hypercubes, Independent spanning trees on twisted cubes, A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges, Fault-free mutually independent Hamiltonian cycles of faulty star graphs, The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Generalized diameters and Rabin numbers of networks
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Hamiltonicity of the hierarchical cubic network
- Wide diameters of Cartesian product graphs and digraphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Embedding cube-connected cycles graphs into faulty hypercubes
- Mutually independent hamiltonian paths in star networks
- Longest fault-free paths in star graphs with vertex faults
