Divisibility graph for symmetric and alternating groups

From MaRDI portal
(Redirected from Publication:5500714)



Abstract: Let X be a non-empty set of positive integers and X∗=Xsetminus1. The divisibility graph D(X) has X∗ as the vertex set and there is an edge connecting a and b with a,binX∗ whenever a divides b or b divides a. Let X=csG be the set of conjugacy class sizes of a group G. In this case, we denote D(csG) by D(G). In this paper we will find the number of connected components of D(G) where G is the symmetric group Sn or is the alternating group An.












This page was built for publication: Divisibility graph for symmetric and alternating groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500714)