{
  "id": "enwiki-001364684176",
  "slug": "pairwise-compatibility-graph",
  "title": "Pairwise compatibility graph",
  "qid": "",
  "lead": "In graph theory, a graph 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}] . The subclasses of PCG include graphs of at most seven vertices, cycles, forests, complete graphs, interval graphs and ladder graphs. However, there is a graph with eight vertices that is known not to be a PCG.",
  "body": "In graph theory, a graph 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}] . The subclasses of PCG include graphs of at most seven vertices, cycles, forests, complete graphs, interval graphs and ladder graphs. However, there is a graph with eight vertices that is known not to be a PCG.",
  "categories": [
    "20384058",
    "23603337",
    "26220375",
    "44381894",
    "44446176",
    "58172403"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1364684176",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1784323571.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001364684176",
    "type": "webpage",
    "title": "Pairwise compatibility graph",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/pairwise-compatibility-graph",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001364684176",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1364684176",
    "note": "Immutable snapshot enwiki-001364684176"
  }
}