{
  "aliases": [
    "degree-diameter"
  ],
  "backlinks": null,
  "body": "\n## Problem\n\nIn graph theory, the **degree–diameter problem** asks for the maximum possible number $n_{d,k}$ of vertices in a finite simple undirected graph of maximum degree at most $d$ and diameter at most $k$. A breadth-first search gives a general upper bound known as the Moore bound.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "degree-diameter"
    ],
    "inventory": [
      "60KS8P8BWT"
    ],
    "kind": "problem",
    "name": "Degree diameter problem",
    "same_as": {
      "wikidata": "Q5251835",
      "wikipedia": "Degree diameter problem"
    },
    "sources": [
      {
        "locator": "Degree diameter problem",
        "mention": "wikipedia://en/19726161",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:19726161@r1375259210"
      }
    ],
    "tag": "2G7061NXSP"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/2G7061NXSP/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2G7061NXSP.md",
  "msc": null,
  "name": "Degree diameter problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2G7/2G7061NXSP.md",
  "status": null,
  "tag": "2G7061NXSP",
  "uri": "m2://2G7061NXSP",
  "url": "https://math2.tamnd.com/wiki/degree-diameter-problem/",
  "writing": {
    "tag": "2G7061NXSP",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      },
      {
        "what": "section History",
        "note": "with the year of the first source",
        "have": 0,
        "want": 1
      }
    ]
  }
}