Quotient graphs for power graphs

From MaRDI portal




Abstract: In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph mathcalP0(G) of a finite group G, finding a formula for the number c(mathcalP0(G)) of its components which is particularly illuminative when GleqSn is a fusion controlled permutation group. We make use of the proper quotient power graph widetildemathcalP0(G), the proper order graph mathcalO0(G) and the proper type graph mathcalT0(G). We show that all those graphs are quotient of mathcalP0(G) and demonstrate a strong link between them dealing with G=Sn. We find simultaneously c(mathcalP0(Sn)) as well as the number of components of widetildemathcalP0(Sn), mathcalO0(Sn) and mathcalT0(Sn).









This page was built for publication: Quotient graphs for power graphs

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