New Results on Pairwise Compatibility Graphs

Sheikh Azizul Hakim, Bishal Basak Papan, Md. Saidur Rahman

A graph $G=(V,E)$ 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…