On the generating graphs of symmetric groups

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.