On finite groups whose power graphs are line graphs (Q6972649)

Let \(G\) be a group. The power graph \(\mathcal{P}(G)\) of the group \(G\) is a simple undirected graph with vertex set \(G\) such that two vertices \(x\) and \(y\) are adjacent if one is a power of the other. It has been proved that two finite groups which have isomorphic power graphs have the same number of elements of each order and two finite abelian groups are isomorphic if and only if their power graphs are isomorphic.\N\NRecall that the line graph \(L(\Gamma)\) of the graph \(\Gamma\) is the graph whose vertex set is all the edges of \(\Gamma\) and two vertices of \(L(\Gamma)\) are adjacent if they are incident in \(\Gamma\). \textit{S. Bera} [Commun. Algebra 50, No. 11, 4652--4668 (2022; Zbl 1514.20084)] all finite nilpotent groups whose power graphs and proper power graphs are line graphs have been classified. In the paper under review, the authors extend this result to arbitrary finite groups. In particular, they prove that if \(G\) is a finite group, then \(\mathcal{P}(G)\) is a line graph of some graph \(\Gamma\) if and only if \(G\) is a cyclic group of prime power order.