Hamiltonian cycles in unitary prefix transposition rearrangement graphs

DOI10.1016/J.DAM.2014.05.003zbMATH Open1319.05083OpenAlexW2025422734MaRDI QIDQ491601FDOQ491601

Authors: 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

Recommendations

• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamilton-connected derangement graphs on \(S_ n\)
• Reversals Cayley graphs of symmetric groups
• Edit Distances and Factorisations of Even Permutations
• Lower bounding edit distances between permutations

zbMATH Keywords

Hamiltonian cycleCayley graphgenome rearrangementunitary prefix transpositionLovász conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Reversals Cayley graphs of symmetric groups

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

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