{
  "id": "2012.09956",
  "version": "v1",
  "published": "2020-12-17T22:23:59.000Z",
  "updated": "2020-12-17T22:23:59.000Z",
  "title": "On the minimal sum of edges in a signed edge-dominated graph",
  "authors": [
    "Danila Cherkashin",
    "Pavel Prozorov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that the minimal sum of edges in a signed edge-dominated graph with $n$ vertices is at least $-\\frac{n^2}{25}$. Also we provide an example of a signed edge-dominated graph with $n$ vertices with the sum of edges $-(1+o(1))\\frac{n^2}{8(1 + \\sqrt{2})^2}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-12-17T22:23:59.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "signed edge-dominated graph",
      "minimal sum"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}