A note on Hamiltonian decomposition of bubble-sort graphs

DOI10.1080/00207160.2015.1045887MaRDI QIDQ5739598zbMATH OpenOpenAlexFDO

Authors Fairouz Beggas, Brahim Neggazi

Publication date 19 July 2016

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2015.1045887

zbMATH Keywords

bubble-sort graphCayley graphHamiltonian decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• One conjecture of bubble-sort graphs
• Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
• The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
• scientific article; zbMATH DE number 1556200
• Hamiltonian laceability of bubble-sort graphs with edge faults

Cites work

• Hamiltonian decompositions of complete graphs
• One conjecture of bubble-sort graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• The construction of mutually independent Hamiltonian cycles in bubble-sort graphs

Cited in

(3)

• One conjecture of bubble-sort graphs
• Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
• Decycling bubble sort graphs

This page was built for publication: A note on Hamiltonian decomposition of bubble-sort graphs

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