Connectivity of the reduced power graphs of finite simple groups

DOI10.1016/J.DISC.2023.113740MaRDI QIDQ6184522zbMATH OpenOpenAlexFDO

Authors Yilong Yang

Publication date 25 January 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2023.113740

zbMATH Keywords

finite groupfinite groups of Lie typefinite simple groupspower graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Review text

Let \(G\) be a finite group. The directed power graph of \(G\) was first introduced by \textit{A. V. Kelarev} and \textit{S. J. Quinn} [Contrib. Gen. Algebra 12, 229--235 (2000; Zbl 0966.05040)]. It is a graph with vertex set \(G\) and two distinct vertices \(g,h \in G\) connected by an edge from \(g\) to \(h\) if and only if \(h\) is a power of \(g\). On the other hand, the undirected power graph of \(G\) is the same graph, but all edge directions are removed. The reduced power graph of \(G\) is obtained from the undirected power graph by deleting the identity element. \textit{N. Akbari} and \textit{A. R. Ashrafi} in [Quasigroups Relat. Syst. 23, No. 2, 165--173 (2015; Zbl 1345.20018)] conjectured that if a non-abelian finite simple group has a connected reduced power graph, then it must be an alternating group. In this paper, the author disproves this conjecture by providing a complete description of when the reduced power graphs of \(\mathrm{PGL}_{n}(\mathbb{F}_{q})\) are connected for all \(q\) and all \(n\geq 3\). He also provides upper \(q\) bounds on their diameters and in case of disconnection, a description of all connected components.

Recommendations

• Note on the power graph of finite simple groups.
• Proper connection of power graphs of finite groups
• Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups
• Forbidden subgraphs in reduced power graphs of finite groups
• On the connectivity of proper power graphs of finite groups

Cites work

• A combinatorial characterization of finite groups of prime exponent
• scientific article; zbMATH DE number 53165 (Why is no real title available?)
• scientific article; zbMATH DE number 3072076 (Why is no real title available?)
• Note on the power graph of finite simple groups.
• On power graphs of finite groups with forbidden induced subgraphs
• On the stabilizer of companion matrices
• Power graph of finite abelian groups
• Primary cyclotomic units and a proof of Catalans conjecture
• Recent developments on the power graph of finite groups -- a survey
• The Generalized Jordan Canonical Form
• Undirected power graphs of semigroups

Cited in

(1)

• Power graphs of completely 0-simple semigroups

This page was built for publication: Connectivity of the reduced power graphs of finite simple groups

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