{
  "aliases": [
    "distance-transitive-graphs"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical field of graph theory, a **distance-transitive graph** is a [[graph|00C0BR7D7H]] such that, given any two vertices $v$ and $w$ at any [[distance|0QV9VNNB4Z]] $i$, and any other two vertices $x$ and $y$ at the same distance, there is an automorphism of the graph that carries $v$ to $x$ and $w$ to $y$. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "distance-transitive-graphs"
    ],
    "inventory": [
      "CTCQ3GDJQE"
    ],
    "kind": "concept",
    "name": "Distance-transitive graph",
    "same_as": {
      "wikidata": "Q4391306",
      "wikipedia": "Distance-transitive graph"
    },
    "sources": [
      {
        "locator": "Distance-transitive graph",
        "mention": "wikipedia://en/7768222",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:7768222@r1352720983"
      }
    ],
    "tag": "QCZ3NE42AC"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/QCZ3NE42AC/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/QCZ3NE42AC.md",
  "msc": null,
  "name": "Distance-transitive graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/QCZ/QCZ3NE42AC.md",
  "status": null,
  "tag": "QCZ3NE42AC",
  "uri": "m2://QCZ3NE42AC",
  "url": "https://math2.tamnd.com/wiki/distance-transitive-graph/",
  "writing": {
    "tag": "QCZ3NE42AC",
    "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
      }
    ]
  }
}