Engel and co-Engel graphs of finite groups

Abstract

Let G be a group. Associate a directed graph E(G) (called the Engel digraph of G) with G whose vertex set is G, with an arc (x,y) if [y, k x]=1 for some positive integer k, where [y,kx] is the iterated commutator [y,x,x,…,x], with k terms x in the expression. From this we define the Engel graph E(G) by ignoring directions; the co-Engel graph Ec(G) 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 100 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 Ec(G) form the Fitting subgroup F(G) of G. In this paper, we realize the induced subgraph of co-Engel graphs of certain finite non-Engel groups G induced by G F(G). We write Ec-(G) to denote the subgraph of Ec(G) induced by G F(G). We also compute genus, various spectra, energies and Zagreb indices of Ec-(G) for those groups. As a consequence, we determine (up to isomorphism) all finite non-Engel group G such that the clique number of Ec-(G) is at most 4 and Ec-(G) is toroidal or projective. Further, we show that Ec-(G) is ALQ-integral and satisfies the E-LE conjecture and the Hansen-Vukicevi\'c conjecture for the groups considered in this paper.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…