Optimal bounds for disjoint Hamilton cycles in star graphs

DOI10.1142/S0129054118500090zbMATH Open1391.05152WikidataQ129895042 ScholiaQ129895042MaRDI QIDQ4640337FDOQ4640337

Authors: Parisa Derakhshan, Walter Hussak 

Publication date: 17 May 2018

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

Recommendations

• Star graph automorphisms and disjoint Hamilton cycles
• Disjoint Hamilton cycles in the star graph
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• Conditional fault-tolerant Hamiltonicity of star graphs
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges

zbMATH Keywords

automorphismsHamilton cyclesstar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The \((n,k)\)-star graph: A generalized star graph
• Star graph automorphisms and disjoint Hamilton cycles
• Disjoint Hamilton cycles in the star graph
• Symmetric Hamilton cycle decompositions of the complete graph
• Title not available (Why is that?)

Cited In (3)

• Disjoint Hamilton cycles in the star graph
• Decomposition of star network \(S_5\) into Hamilton cycles
• Communication Performance Evaluation of the Locally Twisted Cube

This page was built for publication: Optimal bounds for disjoint Hamilton cycles in star graphs

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