On the mutually independent Hamiltonian cycles in faulty hypercubes
From MaRDI portal
Publication:2446440
DOI10.1016/j.ins.2013.02.020zbMath1284.05315OpenAlexW2110851278MaRDI QIDQ2446440
Riste Škrekovski, Vida Vukašinović, Petr Gregor
Publication date: 16 April 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.02.020
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model ⋮ The domination number of exchanged hypercubes ⋮ Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution ⋮ Rooted level-disjoint partitions of Cartesian products ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ Hamiltonian cycles in hypercubes with more faulty edges
Cites Work
- Unnamed Item
- Unnamed Item
- Mutually independent bipanconnected property of hypercube
- 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
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Perfect matchings extend to Hamilton cycles in hypercubes
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Bluecube: constructing a hypercube parallel computing and communication environment over Bluetooth radio systems
- On Hamiltonian circuits and spanning trees of hypercubes
- On $r$-extendability of the hypercube $Q\sb n$
This page was built for publication: On the mutually independent Hamiltonian cycles in faulty hypercubes
