{
  "id": "2201.01224",
  "version": "v3",
  "published": "2022-01-04T16:11:43.000Z",
  "updated": "2022-02-15T17:05:09.000Z",
  "title": "Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions",
  "authors": [
    "Domingos M. Cardoso",
    "Inês Serôdio Costa",
    "Rui Duarte"
  ],
  "comment": "arXiv admin note: substantial text overlap with arXiv:2012.01992",
  "categories": [
    "math.CO"
  ],
  "abstract": "Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove that the least eigenvalue of the $n$-Queens' graph $\\mathcal{Q}(n)$ is equal to $-4$ for every $n \\ge 4$ and it is also proven that the multiplicity of this eigenvalue is $(n-3)^2$. Additionally, some results on the edge clique partition graph parameters are obtained.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2022-02-15T17:05:09.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "05C70"
    ],
    "keywords": [
      "sharp bounds",
      "eigenvalue",
      "edge clique partition graph parameters",
      "sufficient",
      "arbitrary graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}