English

Engel graph associated with a group

Group Theory 2007-08-16 v2 Combinatorics

Abstract

Let GG be a non-Engel group and let L(G)L(G) be the set of all left Engel elements of GG. Associate with GG a graph EG\mathcal{E}_G as follows: Take G\L(G)G\backslash L(G) as vertices of EG\mathcal{E}_G and join two distinct vertices xx and yy whenever [x,ky]1[x,_k y]\not=1 and [y,kx]1[y,_k x]\not=1 for all positive integers kk. We call EG\mathcal{E}_G, the Engel graph of GG. In this paper we study the graph theoretical properties of EG\mathcal{E}_G.

Keywords

Cite

@article{arxiv.math/0510296,
  title  = {Engel graph associated with a group},
  author = {Alireza Abdollahi},
  journal= {arXiv preprint arXiv:math/0510296},
  year   = {2007}
}

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