Quotient graphs for power graphs

DOI10.4171/RSMUP/138-3MaRDI QIDQ1700659zbMATH OpenFDO

Authors Daniela Bubboloni, M. A. Iranmanesh, Seyed M. Shaker

Publication date 21 February 2018

Published in Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.02966

zbMATH Keywords

permutation groupspower graphquotient graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Symmetric groups (20B30)

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 $mathcal{P}_0(G)$ of a finite group $G$, finding a formula for the number $c(mathcal{P}_0(G))$ of its components which is particularly illuminative when $Gleq{S}_n$ is a fusion controlled permutation group. We make use of the proper quotient power graph $widetilde{mathcalP}_0(G)$, the proper order graph $mathcal{O}_0(G)$ and the proper type graph $mathcal{T}_0(G)$. We show that all those graphs are quotient of $mathcal{P}_0(G)$ and demonstrate a strong link between them dealing with $G=S_n$. We find simultaneously $c(mathcal{P}_0(S_n))$ as well as the number of components of $widetilde{mathcalP}_0(S_n)$, $mathcal{O}_0(S_n)$ and $mathcal{T}_0(S_n)$.

Review text

Summary: 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 one of its quotient graphs. Here we apply that procedure to the proper power graph \(\mathcal{P}_0(G)\) of a finite group \(G\), finding a formula for the number of its components which is particularly illuminative when \(G\leq S_n\) is a fusion controlled permutation group. We make use of the proper quotient power graph \(\widetilde{\mathcal{P}}_0(G)\), the proper order graph \(\mathcal{O}_0(G)\) and the proper type graph \(\mathcal{T}_0(G)\). All those graphs are quotient of \(\mathcal{P}_0(G)\). We emphasize the strong link between them determining number and typology of the components of the above graphs for \(G=S_n\). In particular, we prove that the power graph \(\mathcal{P}(S_n)\) is \(2\)-connected if and only if the type graph \(\mathcal{T}(S_n)\) is \(2\)-connected, if and only if the order graph \(\mathcal{O}(S_n)\) is \(2\)-connected, that is, if and only if either \(n = 2\) or none of \(n\), \(n-1\) is a prime.

Recommendations

• On some graphs associated with the finite alternating groups
• Certain properties of the power graph associated with a finite group.
• On groups with specified quotient power graphs
• On connectedness of power graphs of finite groups
• The undirected power graph of a finite group.

Cited in

(20)

• Forbidden subgraphs in reduced power graphs of finite groups
• Finite groups whose intersection power graphs are toroidal and projective-planar
• On connectedness of power graphs of finite groups
• The complement of proper power graphs of finite groups
• On some graphs associated with the finite alternating groups
• The diameter of power graphs of symmetric groups
• The metric dimension of the enhanced power graph of a finite group
• Proper connection of power graphs of finite groups
• Vertex connectivity of the power graph of a finite cyclic group. II
• On groups with specified quotient power graphs
• Perfect codes in proper reduced power graphs of finite groups
• Some properties of various graphs associated with finite groups
• The order supergraph of the power graph of a finite group
• On the order supergraph of the power graph of a finite group
• Connectivity of superpower graphs of some non-abelian finite groups
• On connected components and perfect codes of proper order graphs of finite groups
• Forbidden subgraphs in enhanced power graphs of finite groups
• Graphs on groups in terms of the order of elements: a review
• Perfect codes in proper intersection power graphs of finite groups
• Metric and strong metric dimension in intersection power graphs of finite groups

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)