One conjecture of bubble-sort graphs

DOI10.1016/j.ipl.2011.06.005zbMath1260.68303OpenAlexW2010234837WikidataQ123266990 ScholiaQ123266990MaRDI QIDQ1944169

Jian-Bo Lu, Pan-Feng Niu, Hai-Zhong Shi

Publication date: 4 April 2013

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.005

zbMATH Keywords

Cayley graphHamiltonian cycleinterconnection networksbubble-sort graphdecomposition of bubble-sort graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ The 3-good-neighbor connectivity of modified bubble-sort graphs ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ A note on Hamiltonian decomposition of Bubble-Sort graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Some problems on Cayley graphs
• Vertex reconstruction in Cayley graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Hamiltonian Decomposition of Some Interconnection Networks
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: One conjecture of bubble-sort graphs