Pairwise compatibility graph

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}]$.