On the mutually independent Hamiltonian cycles in faulty hypercubes

DOI10.1016/J.INS.2013.02.020MaRDI QIDQ2446440zbMATH OpenOpenAlexFDO

Authors Vida Vukašinović, Petr Gregor, Riste Škrekovski

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

zbMATH Keywords

faulty edgeHamiltonian cycleHamiltonian pathhypercubeinterconnection network

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
• A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Hamiltonian cycles in hypercubes with faulty edges
• Hamiltonian cycles in hypercubes with more faulty edges
• Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
• Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges

Cites work

• A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Bluecube: constructing a hypercube parallel computing and communication environment over Bluetooth radio systems
• 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-tolerant Hamiltonian laceability of hypercubes.
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 888853 (Why is no real title available?)
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Mutually independent bipanconnected property of hypercube
• On $r$-extendability of the hypercube $Q\sb n$
• On Hamiltonian circuits and spanning trees of hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes

Cited in

(13)

• Broadcasting multiple messages in the 1-in port model in optimal time
• Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
• Modelling simultaneous broadcasting by level-disjoint partitions
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
• The domination number of exchanged hypercubes
• Time-optimal broadcasting of multiple messages in 1-in port model
• Hamiltonian cycles in hypercubes with more faulty edges
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
• Rooted level-disjoint partitions of Cartesian products
• 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

This page was built for publication: On the mutually independent Hamiltonian cycles in faulty hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446440)