{
  "aliases": [
    "distance-regular-graphs",
    "intersection-array"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical field of graph theory, a **distance-regular graph** is a [[regular graph|0KA4S8R39M]] such that for any two vertices $v$ and $w$, the number of vertices at [[distance|0QV9VNNB4Z]] $j$ from $v$ and at distance $k$ from $w$ depends only upon $j$, $k$, and the distance between $v$ and $w$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "distance-regular-graphs",
      "intersection-array"
    ],
    "inventory": [
      "5N8CXHPBF3"
    ],
    "kind": "concept",
    "name": "Distance-regular graph",
    "same_as": {
      "wikidata": "Q3115556",
      "wikipedia": "Distance-regular graph"
    },
    "sources": [
      {
        "locator": "Distance-regular graph",
        "mention": "wikipedia://en/7768943",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:7768943@r1326563603"
      }
    ],
    "tag": "TVHSJ65MXG"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/TVHSJ65MXG/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/TVHSJ65MXG.md",
  "msc": null,
  "name": "Distance-regular graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/TVH/TVHSJ65MXG.md",
  "status": null,
  "tag": "TVHSJ65MXG",
  "uri": "m2://TVHSJ65MXG",
  "url": "https://math2.tamnd.com/wiki/distance-regular-graph/",
  "writing": {
    "tag": "TVHSJ65MXG",
    "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
      }
    ]
  }
}