Engel and co-Engel graphs of finite groups
Abstract
Let be a group. Associate a directed graph (called the Engel digraph of ) with whose vertex set is , with an arc if for some positive integer , where is the iterated commutator , with terms in the expression. From this we define the Engel graph by ignoring directions; the co-Engel graph is its complement. The co-Engel graph, under the name ``Engel graph'', was introduced by Abdollahi. However, the name we use is more natural. We begin with some general results about the Engel digraph and graph, before turning our attention to the co-Engel graph. Among other things, we show that the undirected Engel graph does not determine the directed version up to isomorphism, though counterexamples seem to be fairly rare: there are just two orders less than for which this happens. We also prove a universality theorem: every finite digraph is an induced sub-digraph of the Engel digraph of a finite group. The isolated vertices of form the Fitting subgroup of . In this paper, we realize the induced subgraph of co-Engel graphs of certain finite non-Engel groups induced by . We write to denote the subgraph of induced by . We also compute genus, various spectra, energies and Zagreb indices of for those groups. As a consequence, we determine (up to isomorphism) all finite non-Engel group such that the clique number of is at most and is toroidal or projective. Further, we show that is ALQ-integral and satisfies the E-LE conjecture and the Hansen-Vuki{\v{c}}evi{\'c} conjecture for the groups considered in this paper.
Cite
@article{arxiv.2408.03879,
title = {Engel and co-Engel graphs of finite groups},
author = {Peter J. Cameron and Rishabh Chakraborty and Rajat Kanti Nath and Deiborlang Nongsiang},
journal= {arXiv preprint arXiv:2408.03879},
year = {2026}
}