On the Structure of Finite Groups Associated to Regular Non-Centralizer Graph
arXiv:1812.09363
Abstract
The non-centralizer graph of a finite group is the simple graph whose vertices are the elements of with two vertices and are adjacent if their centralizers are distinct. The induced subgroup of associated with the vertex set is called the induced non-centralizer graph of . The notions of non-centralizer and induced non-centralizer graphs were introduced by Tolue in \cite{to15}. A finite group is called regular (resp. induced regular) if its non-centralizer graph (resp. induced non-centralizer graph) is regular. In this paper we study the structure of regular groups as well as induced regular groups. Among the many obtained results, we prove that if a group is regular (resp. induced regular) then as an elementary group (resp. group).