Lesson plan

Pairwise compatibility graph

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.

Back to article

Article summary

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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.