Engel graph associated with a group
| dc.creator | Abdollahi, Alireza | |
| dc.date | 2005-10-14 | |
| dc.date | 2007-08-16 | |
| dc.date.accessioned | 2026-07-07T08:23:49Z | |
| dc.date.available | 2026-07-07T08:23:49Z | |
| dc.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$. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/math/0510296 | |
| dc.identifier | http://arxiv.org/abs/math/0510296 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/136132 | |
| dc.subject | Group Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 20F45; 20D60; 05C25 | |
| dc.title | Engel graph associated with a group | |
| dc.type | text |