On finite groups whose power graph is claw-free

Pallabi Manna, Santanu Mandal, Andrea Lucchini

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1,3}$. The undirected power graph of a group $G$ has vertices the ele…