{
  "id": "2107.01157",
  "version": "v1",
  "published": "2021-07-02T15:58:19.000Z",
  "updated": "2021-07-02T15:58:19.000Z",
  "title": "Matching in power graphs of finite groups",
  "authors": [
    "Peter J. Cameron",
    "V V Swathi",
    "M S Sunitha"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-07-02T15:58:19.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C25"
    ],
    "keywords": [
      "finite group",
      "power graphs possess perfect matching",
      "vertex set",
      "undirected simple graph",
      "matching number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}