{
  "id": "1911.06261",
  "version": "v1",
  "published": "2019-11-14T17:36:19.000Z",
  "updated": "2019-11-14T17:36:19.000Z",
  "title": "Flexibility and movability in Cayley graphs",
  "authors": [
    "Arindam Biswas"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Let $\\mathbf{\\Gamma} = (V,E)$ be a (non-trivial) finite graph with $\\lambda: E \\rightarrow \\mathbb{R}_{+}$, an edge labelling of $\\mathbf{\\Gamma}$. Let $\\rho : V\\rightarrow \\mathbb{R}^{2}$ be a map which preserves the edge labelling. The graph $\\mathbf{\\Gamma}$ is said to be flexible if there exists an infinite number of such maps (upto equivalence by rigid transformations) and it is said to be movable if there exists an infinite number of injective maps. We study movability of Cayley graphs and construct regular moving graphs of all degrees. Further, we give explicit constructions of \"dense\", movable graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-11-14T17:36:19.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52C25",
      "05C15",
      "05C25",
      "05C38",
      "05C42",
      "70B15"
    ],
    "keywords": [
      "cayley graphs",
      "infinite number",
      "flexibility",
      "construct regular moving graphs",
      "finite graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}