Disjoint Hamilton cycles in transposition graphs

DOI10.1016/J.DAM.2016.02.007zbMath1335.05105OpenAlexW2294611082MaRDI QIDQ277617

Walter Hussak

Publication date: 2 May 2016

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

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

zbMATH Keywords

automorphismsedge-disjoint Hamilton cyclesstar graphstransposition graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube

Cites Work

• Automorphism group of the complete transposition graph
• Orienting Cayley graphs generated by transposition trees
• Disjoint Hamilton cycles in the star graph
• Edge-foreward index of star graphs and other Cayley graphs
• Bisection width of transposition graphs
• Star graph automorphisms and disjoint Hamilton cycles
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
• On the bisection width of the transposition network
• Transposition Graphs

This page was built for publication: Disjoint Hamilton cycles in transposition graphs