{
  "id": "1911.01113",
  "version": "v1",
  "published": "2019-11-04T10:24:15.000Z",
  "updated": "2019-11-04T10:24:15.000Z",
  "title": "On eigenvalue multiplicity in signed graphs",
  "authors": [
    "Farzaneh Ramezani",
    "Peter Rowlinson",
    "Zoran Stanic"
  ],
  "comment": "13 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which the bound can be decreased.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-11-04T10:24:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C22",
      "05C50"
    ],
    "keywords": [
      "signed graphs",
      "eigenvalue multiplicity",
      "cubic polynomial upper bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}