{
  "id": "1706.06145",
  "version": "v1",
  "published": "2017-06-19T19:11:43.000Z",
  "updated": "2017-06-19T19:11:43.000Z",
  "title": "Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time",
  "authors": [
    "Roman Nedela",
    "Ilia Ponomarenko"
  ],
  "comment": "22 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2\\times C_2\\times C_p$. This result, together with the known similar result for circulant graphs, shows that recognising and testing isomorphism of Cayley graphs over an abelian group of order $4p$ can be done in polynomial time.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-06-19T19:11:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E18",
      "05C85"
    ],
    "keywords": [
      "cayley graphs",
      "polynomial time",
      "abelian group",
      "testing isomorphism",
      "recognizing"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}