GAP Computations Concerning Hamiltonian Cycles in the Generating Graphs of Finite Groups
Abstract
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian cycles in the generating graphs of finite groups" by Thomas Breuer, Robert M. Guralnick, Andrea Lucchini, Attila Mar\'oti, and G\'abor P. Nagy. The purpose of this writeup is twofold. On the one hand, the computations are documented this way. On the other hand, the GAP code shown for the examples can be used as test input for automatic checking of the data and the functions used.
Keywords
Cite
@article{arxiv.0911.5589,
title = {GAP Computations Concerning Hamiltonian Cycles in the Generating Graphs of Finite Groups},
author = {Thomas Breuer},
journal= {arXiv preprint arXiv:0911.5589},
year = {2012}
}
Comments
LaTeX file, 26 pages, the computations belong to a paper published in Bull. London Math. Soc. 42 (2010); changes to the original version concern the format of GAP output (adjusted to version 4.5) and updated information about the maximal subgroups of the Monster (bounds improved, otherwise results unchanged)