Let be a finite group. The \emph{enhanced power graph} of , denoted by , is the graph with vertex set in which two vertices and are adjacent if and only if there exists an element such that both and belong to . The \emph{proper enhanced power graph} of , denoted by , is the subgraph of induced by the non-dominating vertices. The main objective of this paper is to investigate finite groups whose proper enhanced power graph is claw-free, that is, contains no induced subgraph isomorphic to the complete bipartite graph . We first prove that is claw-free if and only if is cyclic. The set of dominating vertices of forms a cyclic subgroup of the center of , namely the \emph{cyclicizer} of . This allows us to give a precise description of the structure of when is claw-free. If is solvable but not nilpotent, then is metacyclic, or is either a Frobenius group or a -Frobenius group. If is non-solvable, then is isomorphic to or and this allows us to give a complete classification of the non-solvable groups whose proper enhanced power graph is claw-free.

生成讲解博客的中文版本

生成AI智能校验的中文版本