Benson, DeepuDeepuBensonDas, BireswarBireswarDasDey, DipanDipanDeyGhosh, JiniaJiniaGhosh2026-02-182026-04-022026-02-182026-02-0110.1007/s40840-026-02049-x2-s2.0-105029604100https://repository.iitgn.ac.in/handle/IITG2025/34624In this paper, we study the oriented diameter of power graphs of groups. We show that a 2-edge connected power graph of a finite group has oriented diameter at most 4. We prove that the power graph of the cyclic group of order n has oriented diameter 2 for all n≠1,2,4,6. We show that the oriented diameter of 2-edge connected power graphs of non-cyclic nilpotent groups is either 3 or 4. Moreover, we provide necessary and sufficient conditions to determine when such graphs have oriented diameter 3 and when these graphs have diameter 4. This, in turn, gives a polynomial time algorithm for computing the oriented diameter of the power graph of a given nilpotent group.en-USfalseAlgorithm | Finite Groups | Nilpotent Groups | Oriented Diameter | Power GraphsArticle21804206February 2026053arArticleWOS:001685730800001