On some graphs associated with the finite alternating groups
Abstract
Let P0(An), P0(An), P0(T(An)) and O0(An) be respectively the proper power graph, the proper quotient power graph, the proper power type graph and the proper order graph of the alternating group An, for n≥ 3. We determine the number of the components of those graphs. In particular, we prove that the power graph P(An) is 2-connected if and only if the power type graph P(T(An)) is 2-connected, if and only if either n = 3 or none of n, n-1, n-2, n2 and n-12 is a prime. We also give some information on the properties of those components.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.