{
  "aliases": [
    "moore-bound"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **Moore graph** is a [[regular graph|0KA4S8R39M]] whose girth (the shortest [[cycle|0Z05VCBQ7Y]] length) is more than twice its diameter (the distance between the farthest two vertices). If the [[degree|0KS0KRDV4Y]] of such a graph is $d$ and its diameter is $k$, its girth must equal $2k + 1$. This is true, for a graph of degree $d$ and diameter $k$, if and only if its number of vertices (its order) equals\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "moore-bound"
    ],
    "inventory": [
      "3FE0X5KB5K"
    ],
    "kind": "concept",
    "name": "Moore graph",
    "same_as": {
      "wikidata": "Q3115522",
      "wikipedia": "Moore graph"
    },
    "sources": [
      {
        "locator": "Moore graph",
        "mention": "wikipedia://en/4112719",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:4112719@r1374109900"
      }
    ],
    "tag": "7RXRXB3CTT"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/7RXRXB3CTT/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/7RXRXB3CTT.md",
  "msc": null,
  "name": "Moore graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/7RX/7RXRXB3CTT.md",
  "status": null,
  "tag": "7RXRXB3CTT",
  "uri": "m2://7RXRXB3CTT",
  "url": "https://math2.tamnd.com/wiki/moore-graph/",
  "writing": {
    "tag": "7RXRXB3CTT",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}