Disjoint Hamilton cycles in the star graph

Authors:
Roman Čada;Tomáš Kaiser;Moshe Rosenfeld;Zdeněk Ryjáček
Affiliations:
Department of Mathematics and Institute for Theoretical Computer Science (ITI), University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic;Department of Mathematics and Institute for Theoretical Computer Science (ITI), University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic;Computing and Software Systems Program, University of Washington, Tacoma, WA 98402, United States;Department of Mathematics and Institute for Theoretical Computer Science (ITI), University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic
Venue:
Information Processing Letters
Year:
2009

Citing 8
Cited 1

Hamilton cycles that extend transposition matchings in Cayley graphs of Sn

SIAM Journal on Discrete Mathematics
Disjoint Hamiltonian cycles in recursive circulant graphs

Information Processing Letters
A Survey of Combinatorial Gray Codes

SIAM Review
Permutation Generation Methods

ACM Computing Surveys (CSUR)
Algorithm 115: Perm

Communications of the ACM
Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Hamiltonian cycles in the cayley graph of s(n) and a doubly adjacent gray code

Hamiltonian cycles in the cayley graph of s(n) and a doubly adjacent gray code
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes

IEEE Transactions on Computers

Worst-case efficient dominating sets in digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.90

Visualization

Abstract

In 1987, Akers, Harel and Krishnamurthy proposed the star graph @S(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that @S(n) contains @?n/8@? pairwise edge-disjoint Hamilton cycles when n is prime, and @W(n/loglogn) such cycles for arbitrary n.