Cayley graphs formed by conjugate generating sets of S_n

Simple item page
dc.creatorSteinhardt, Jacob
dc.date2007-11-20
dc.date.accessioned2026-07-07T08:43:57Z
dc.date.available2026-07-07T08:43:57Z
dc.descriptionWe investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first is a characterization of minimal conjugate generating sets of S_n. The second is a generalization of a result due to Feng characterizing the automorphism groups of the Cayley graphs formed by certain generating sets composed of cycles. We compute the full automorphism groups subject to a weak condition and conjecture that the characterization still holds without the condition. We also present some computational results in relation to hamiltonicity of Cayley graphs, including a generalization of the work on quasi-hamiltonicity by Gutin and Yeo to undirected graphs.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/0711.3057
dc.identifierhttp://arxiv.org/abs/0711.3057
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142494
dc.subjectCombinatorics
dc.subject05C25
dc.titleCayley graphs formed by conjugate generating sets of S_n
dc.typetext

Files

Collections

arXiv