Abstract The power graph P ( G ) of a finite group is the undirected simple with vertex set , where two elements are adjacent if one other. In this paper, matching numbers graphs groups investigated. We give upper and lower bounds, conditions for to possess perfect matching. formula number any nilpotent group. addition, using some elementary theory, we show that enhanced $$P_e(G)$$ <mml:math xm...
