On the diameter of Engel graphs
This article investigates the diameter of Engel graphs associated with finite groups. Given a finite group \(G\), the Engel graph \(\Gamma(G)\) is the directed graph whose vertices are the non-hypercentral elements of \(G\), with an arc from \(x\) to \(y\) whenever there exists \(n \in \mathbb{N}\) such that \([x,{}_n y] = 1\).\N\NExtending previous work on strong connectivity, the authors establish absolute bounds for the directed diameter of \(\Gamma(G)\): namely, a general upper bound of \(16\), improved to \(12\) when the quotient \(G/Z_\infty(G)\) is not almost simple. The proof combines structural results on finite groups with graph-theoretic methods, notably using properties of commuting graphs, Engel elements and the Fitting series.
- Classical Groups, Derangements and Primes
- Finite groups with odd Sylow automizers
- Finite groups with odd Sylow normalizers
- Graphs defined on groups
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3758571 (Why is no real title available?)
- scientific article; zbMATH DE number 1111401 (Why is no real title available?)
- ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
- On the strong connectivity of the 2-Engel graphs of almost simple groups
- On the theory of power residues
- Prime graph components of finite groups
- Subgroups of Maximal Rank in Finite Exceptional Groups of Lie Type
- The diameter of the commuting graph of a finite group with trivial centre.
- The Engel graph of a finite group
- The Magma algebra system. I: The user language
This page was built for publication: On the diameter of Engel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972695)