{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, the **triameter** is a metric invariant that generalizes the concept of a graph's diameter. It is defined as the maximum sum of pairwise [[distances|0QV9VNNB4Z]] between any three vertices in a connected graph $G$ and is denoted by\n\n$$\\mathop{\\mathrm{tr}}(G) = \\max\\{d(u,v) + d(v,w) + d(u,w) \\mid u,v,w \\in V\\},$$\n\nwhere $V$ is the vertex set of $G$ and $d(u,v)$ is the length of the shortest [[path|03NAMV1DHJ]] between vertices $u$ and $v$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "N6Q88M3V1H"
    ],
    "kind": "concept",
    "name": "Triameter (graph theory)",
    "same_as": {
      "wikidata": "Q133886647",
      "wikipedia": "Triameter (graph theory)"
    },
    "sources": [
      {
        "locator": "Triameter (graph theory)",
        "mention": "wikipedia://en/79699840",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:79699840@r1317724680"
      }
    ],
    "tag": "YXXV9S2DKD"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/YXXV9S2DKD/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/YXXV9S2DKD.md",
  "msc": null,
  "name": "Triameter (graph theory)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/YXX/YXXV9S2DKD.md",
  "status": null,
  "tag": "YXXV9S2DKD",
  "uri": "m2://YXXV9S2DKD",
  "url": "https://math2.tamnd.com/wiki/triameter-graph-theory/",
  "writing": {
    "tag": "YXXV9S2DKD",
    "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
      }
    ]
  }
}