{
  "id": "1703.08109",
  "version": "v1",
  "published": "2017-03-22T05:31:19.000Z",
  "updated": "2017-03-22T05:31:19.000Z",
  "title": "Cayley graphs and symmetric interconnection networks",
  "authors": [
    "Ashwin Ganesan"
  ],
  "comment": "A. Ganesan, \"Cayley graphs and symmetric interconnection networks,\" Proceedings of the Pre-Conference Workshop on Algebraic and Applied Combinatorics (PCWAAC 2016), 31st Annual Conference of the Ramanujan Mathematical Society, pp. 118--170, Trichy, Tamilnadu, India, June 2016",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate the automorphism group and vertex-connectivity of some families of Cayley graphs that have been considered for interconnection networks; we focus on the hypercubes, folded hypercubes, Cayley graphs generated by transpositions, and Cayley graphs from linear codes. New questions and open problems are also discussed.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-03-22T05:31:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cayley graphs",
      "symmetric interconnection networks",
      "automorphism group",
      "introduction",
      "open problems"
    ],
    "tags": [
      "conference paper"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}