Star graph automorphisms and disjoint Hamilton cycles

DOI10.1080/00207160.2012.741226zbMath1273.05116OpenAlexW2080240775MaRDI QIDQ2852107

Parisa Derakhshan, Walter Hussak

Publication date: 8 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.741226

zbMATH Keywords

symmetric groupstar graphinterconnection network topologies

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Disjoint Hamilton cycles in transposition graphs ⋮ Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs

Cites Work

• Disjoint Hamiltonian cycles in recursive circulant graphs
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Disjoint Hamilton cycles in the star graph
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decompositions of random bipartite regular graphs.
• Locally twisted cubes are 4-pancyclic.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Doubly adjacent gray codes for the symmetric group
• The locally twisted cubes
• Hamiltonian-laceability of star graphs
• Mutually independent hamiltonian paths in star networks
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs

This page was built for publication: Star graph automorphisms and disjoint Hamilton cycles