On relaxing the constraints in pairwise compatibility graphs

Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri

A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $…