Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph

DOI10.1016/j.ipl.2021.106094OpenAlexW2938350870WikidataQ114167108 ScholiaQ114167108MaRDI QIDQ2656353

Elena V. Konstantinova, Alexey N. Medvedev

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.03917

zbMATH Keywords

Cayley graphJohnson graphHamiltonian cyclegeneralized prismsBubble-sort graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Subnetwork reliability analysis of bubble-sort graph networks ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ Spectrum of the transposition graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
• Connectivity of generalized prisms over G
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Small cycles in the star graph
• Graph properties of graph associahedra
• Lifting Hamilton cycles of quotient graphs
• Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
• One conjecture of bubble-sort graphs
• Johnson graphs are Hamilton-connected
• A characterization of Hamiltonian prisms
• Braid Groups
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph