Hamiltonian cycles in unitary prefix transposition rearrangement graphs

DOI10.1016/j.dam.2014.05.003zbMath1319.05083OpenAlexW2025422734MaRDI QIDQ491601

Yong-Cai Geng, Sumit K. Garg

Publication date: 18 August 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.003

zbMATH Keywords

Cayley graphHamiltonian cyclegenome rearrangementLovász conjectureunitary prefix transposition

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Bounding prefix transposition distance for strings and permutations
• Some problems on Cayley graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Combinatorics of Permutations
• Sorting by Transpositions Is Difficult
• Edit Distances and Factorisations of Even Permutations
• A group-theoretic model for symmetric interconnection networks
• Sorting by Transpositions

This page was built for publication: Hamiltonian cycles in unitary prefix transposition rearrangement graphs