Published January 1, 2018 | Version v1
Journal article Open

On the generating graphs of symmetric groups

Creators

  • 1. Middle East Tech Univ, Dept Math, TR-06800 Ankara, Turkey

Description

Let S-n and A(n) be the symmetric and alternating groups of degree n, respectively. Breuer, Guralnick, Lucchini, Maroti and Nagy proved that the generating graphs Gamma(S-n) and Gamma(A(n)) are Hamiltonian for sufficiently large n. However, their proof provided no information as to how large n needs to be. We prove that the graphs Gamma(S-n) and Gamma(A(n)) are Hamiltonian provided that n (3) 107.

Files

bib-d7c1bb15-9938-4fbd-966b-68557504f310.txt

Files (104 Bytes)

Name Size Download all
md5:cc50b4b905219cdf5fb6683fb2217588
104 Bytes Preview Download