On power graphs of finite groups with forbidden induced subgraphs

الأصل · EN

The power graph P(G) of a finite group G is a graph whose vertex set is the group G and distinct elements x,y∈ G are adjacent if one is a power of the other, that is, x and y are adjacent if x∈ y or y∈ x. We characterize all finite groups G whose power graphs are claw-free, K₁,₄-free or C₄-free.