Engel and co-Engel graphs of finite groups
Peter J. Cameron, Rishabh Chakraborty, Rajat Kanti Nath, Deiborlang Nongsiang

TL;DR
This paper introduces and analyzes Engel and co-Engel graphs associated with finite groups, exploring their structural properties, realizability, and specific graph invariants, with applications to classifying certain finite groups.
Contribution
It defines the Engel and co-Engel graphs for finite groups, proves universality results, and characterizes groups with specific graph properties, including genus and spectral invariants.
Findings
The Engel graph does not uniquely determine the directed version, with only two exceptions under 100.
Every finite digraph can be embedded as an induced sub-digraph of an Engel graph.
The co-Engel graph's isolated vertices form the Fitting subgroup, and its subgraph $E_c^-(G)$ has specific spectral and topological properties.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
