arXiv:math/0510296 [math.GR]AbstractReferencesReviewsResources
Engel graph associated with a group
Published 2005-10-14, updated 2007-08-16Version 2
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$.
Comments: 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
Related articles: Most relevant | Search more
arXiv:2409.13796 [math.GR] (Published 2024-09-20)
Cyclic Subgroup Graph of a Group
arXiv:2408.03879 [math.GR] (Published 2024-08-07)
Co-Engel graphs of certain finite non-Engel groups
arXiv:2205.14984 [math.GR] (Published 2022-05-30)
The Engel graph of almost simple groups