Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn

@article{Ruskey1993HamiltonCT,
  title={Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn},
  author={Frank Ruskey and Carla D. Savage},
  journal={SIAM J. Discrete Math.},
  year={1993},
  volume={6},
  pages={152-166}
}
Let B be a basis of transpositions for Sn and let Cay B Sn be the Cayley graph of Sn with respect to B It was shown by Kompel makher and Liskovets that Cay B Sn is hamiltonian We extend this result as follows Note that ev ery transposition b in B induces a perfect matchingMb in Cay B Sn We show here when n that for any b B there is a Hamilton cycle in Cay B Sn which includes every edge of Mb That is for n for any basis B of trans positions of Sn and for any b B it is possible to generate all… CONTINUE READING

From This Paper

Topics from this paper.
19 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

\Generating permutations by restricted adjacent transpositions

  • F Rusa, C Ruskey, Savage
  • \Generating permutations by restricted adjacent…
  • 1989

\Hamilton paths in cartesian products of directed cycles," in Cycles in Graphs

  • J Curran, D Witte
  • Annals of Discrete Mathematics
  • 1985

\On Hamilton cycles in Cayley graphs of groups with cyclic commutator subgroup

  • K Kewi, D Keating, Witte
  • Annals of Discrete Mathematics
  • 1985

\Generation of permutations by graphical exchanges

  • M Tchuente
  • ARS Combinatoria
  • 1982

\Sequential generation of arrangements by means of a basis of transpositions

  • V L Koli, V A Kompel 'makher, Liskovets
  • Lo] L. Lovv asz, Problem 11 in Combinatorial…
  • 1970

\Generating all permutations by graphical transpositions

  • P J Sl, Slater
  • Steinhaus, One Hundred P r oblems in Elementary…
  • 1964

\Generation of permutations by adjacent transpositions

  • R Ha, F-Hamiltonian Hh, Graphs
  • Graph Theory and Related T opics
  • 1963

\PERM (Algorithm 115)

  • H F Tr, Trotter
  • W ojda, \Hamiltonian Cycles Through Matchings
  • 1962

Similar Papers

Loading similar papers…