arXiv Analytics

Sign in

arXiv:2205.14984 [math.GR]AbstractReferencesReviewsResources

The Engel graph of almost simple groups

Andrea Lucchini, Pablo Spiga

Published 2022-05-30Version 1

Given a finite group $G$, the Engel graph of $G$ is a directed graph encoding pairs of elements satisfying some Engel word. From the work of Detomi, Lucchini and Nemmi, the strongly connectivity of the Engel graph of an arbitrary group $G$ is reduced to the understanding of the strongly connectivity of the Engel graph of non-abelian simple groups. In this paper, we investigate the strongly connectivity of the Engel graph of finite non-abelian simple groups.

Related articles: Most relevant | Search more
arXiv:math/0510296 [math.GR] (Published 2005-10-14, updated 2007-08-16)
Engel graph associated with a group
arXiv:2311.04486 [math.GR] (Published 2023-11-08)
On the diameter of Engel graphs
arXiv:2308.14725 [math.GR] (Published 2023-08-28)
Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era