Engel graph associated with a group
Abstract
Description
Let $G$ be a non-Engel group and let $L(G)$ be the set of all left Engel elements of $G$.
Associate with $G$ a graph $\mathcal{E}_G$ as follows: Take $G\backslash L(G)$ as vertices of $\mathcal{E}_G$ and join two distinct vertices $x$ and $y$ whenever $[x,_k y]\not=1$ and $[y,_k x]\not=1$ for all positive integers $k$. We call $\mathcal{E}_G$, the Engel graph of $G$. In this paper we study the graph theoretical properties of $\mathcal{E}_G$.
Proposition 2.8 is omitted however the proof is correct. Some errors and misprints are corrected. Corollary 2.11 (now Corollary 2.10) is now in a corrected form
Proposition 2.8 is omitted however the proof is correct. Some errors and misprints are corrected. Corollary 2.11 (now Corollary 2.10) is now in a corrected form