Peter J. Cameron, V V Swathi, M S Sunitha
Published 2021-07-02Version 1
The power graph $\Gamma(G)$ of a finite group $G$ is the undirected simple graph with the vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching number of power graphs of finite groups are investigated and groups whose power graphs possess perfect matching are obtained.
On the connectivity of enhanced power graph of finite group
On a New Graph defined on the order of elements of a Finite Group
Energy of commuting graph of finite groups whose centralizers are Abelian
![QR code for arXiv:2107.01157 [math.CO]](http://oss.arxitics.com/images/favicon.svg)