On some graphs associated with the finite alternating groups

preprint2016arXivOpen access

Abstract

Let P0(An),P~0(An),P0(T(An))P_0(A_n), \widetilde{P}_0(A_n), P_0(\mathcal{T}(A_n)) and O0(An)\mathcal{O}_0(A_n) 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 AnA_n, for n≥3.n\geq 3. We determine the number of the components of those graphs. In particular, we prove that the power graph P(An)P(A_n) is 22-connected if and only if the power type graph P(T(An))P(\mathcal{T}(A_n)) is 22-connected, if and only if either n=3n = 3 or none of n,n−1,n−2,n2n, n-1, n-2, \frac{n}{2} and n−12{\frac{n-1}{2}} is a prime. We also give some information on the properties of those components.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.