{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a [[graph|00C0BR7D7H]] $G$ is a **pairwise compatibility graph** (PCG) if there exists a weighted tree $T$ and two non-negative real numbers $d_{min} \\leq d_{max}$ such that each node $u'$ of $G$ has a one-to-one mapping with a leaf node $u$ of $T$ such that two nodes $u'$ and $v'$ are adjacent in $G$ if and only if the distance between $u$ and $v$ are in the interval $[d_{min}, d_{max}]$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "9TBKXJ5CYB"
    ],
    "kind": "concept",
    "name": "Pairwise compatibility graph",
    "same_as": {
      "wikidata": "Q111169660",
      "wikipedia": "Pairwise compatibility graph"
    },
    "sources": [
      {
        "locator": "Pairwise compatibility graph",
        "mention": "wikipedia://en/69628781",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:69628781@r1364684176"
      }
    ],
    "tag": "M063AZYXB5"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/M063AZYXB5/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/M063AZYXB5.md",
  "msc": null,
  "name": "Pairwise compatibility graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/M06/M063AZYXB5.md",
  "status": null,
  "tag": "M063AZYXB5",
  "uri": "m2://M063AZYXB5",
  "url": "https://math2.tamnd.com/wiki/pairwise-compatibility-graph/",
  "writing": {
    "tag": "M063AZYXB5",
    "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
      }
    ]
  }
}