{
  "id": "1306.2690",
  "version": "v2",
  "published": "2013-06-12T01:52:58.000Z",
  "updated": "2013-06-30T03:44:57.000Z",
  "title": "On Some Expander Graphs and Algebraic Cayley Graphs",
  "authors": [
    "Xiwang Cao"
  ],
  "comment": "17 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Expander graphs have many interesting applications in communication networks and other areas, and thus these graphs have been extensively studied in theoretic computer sciences and in applied mathematics. In this paper, we use reversible difference sets and generalized difference sets to construct more expander graphs, some of them are Ramanujan graphs. Three classes of elementary constructions of infinite families of Ramanujan graphs are provided. It is proved that for every even integer $k>4$, if $2(k+2)=rs$ for two even numbers $r$ and $s$ with $s\\geq 4$ and $2s>r\\geq s$, or $r\\geq 4$ and $2r>s\\geq r$, then there exists an $k$-regular Ramanujan graph. As a consequence, there exists an $k$-regular Ramanujan graph with $k=2t^2-2$ for every integer $t>2$. It is also proved that for every odd integer $m$, there is an $(2^{2m-2}+2^{m-1})$-regular Ramanujan graph. These results partially solved the long hanging open question for the existence of $k$-regular Ramanujan graphs for every positive integer $k$.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-06-30T03:44:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05B10",
      "11T71",
      "68M10",
      "68R10"
    ],
    "keywords": [
      "expander graphs",
      "algebraic cayley graphs",
      "regular ramanujan graph",
      "theoretic computer sciences",
      "long hanging open question"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1306.2690C"
    }
  }
}