{
  "aliases": [
    "median-network"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a division of mathematics, a **median graph** is an undirected graph in which every three vertices $a$, $b$, and $c$ have a unique *median*: a vertex $m(a,b,c)$ that belongs to shortest paths between each pair of $a$, $b$, and $c$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "median-network"
    ],
    "inventory": [
      "GRAEX0872F"
    ],
    "kind": "concept",
    "name": "Median graph",
    "same_as": {
      "wikidata": "Q3115592",
      "wikipedia": "Median graph"
    },
    "sources": [
      {
        "locator": "Median graph",
        "mention": "wikipedia://en/16970848",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:16970848@r1343824067"
      }
    ],
    "tag": "5HA8JR4020"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/5HA8JR4020/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/5HA8JR4020.md",
  "msc": null,
  "name": "Median graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5HA/5HA8JR4020.md",
  "status": null,
  "tag": "5HA8JR4020",
  "uri": "m2://5HA8JR4020",
  "url": "https://math2.tamnd.com/wiki/median-graph/",
  "writing": {
    "tag": "5HA8JR4020",
    "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
      }
    ]
  }
}